Lower bounds for constant weight codes |
| |
| Abstract: | LetA(n,2delta,w)denote the maximum number of codewords in any binary code of lengthn, constant weightw, and Hamming distance2deltaSeveral lower bounds forA(n,2delta,w)are given. Forwanddeltafixed,A(n,2delta,w) geq n^{W-delta+l}/w!andA(n,4,w)sim n^{w-l}/w!asn rightarrow infty. In most cases these are better than the "Gilbert bound." Revised tables ofA(n,2 delta,w)are given in the rangen leq 24anddelta leq 5. |
| |
| Keywords: | |
|
|
