A Class of Punctured Simplex Codes Which Are Proper for Error Detection
Binary linear [n, k] codes that are proper for error detection are known for many combinations of n and k. For the remaining combinations, existence of proper codes is conjectured. In this paper, a particular class of [n, k] codes is studied in detail. In particular, it is shown that these codes are proper for many combinations of n and k which were previously unsettled.
simplex codes error detection proper codes punctured codes satisfactory codes ugly codes