The complement of binary linear codes for error detection
Fang‐Wei Fu, Torleiv Kløve · 2003
For a binary code C of length n, let C~ = V/sub n//spl bsol/C, be the complementary code. The main result of this paper is to determine K(n), the largest integer such that C~ is good for error detection for all linear [n, k] codes C with k/spl les/K(n).