Some new constant weight codes (Corresp.)

Nonlinear cyclic codes are constructed which improve on published lower bounds for the number A(n,d,w) of codewords in a binary code of length n , constant weight w , and minimum distance d .

[1]  ANDRIES E. BROUWER,et al.  A few new constant weight codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[2]  N. J. A. Sloane,et al.  Bounds for binary codes of length less than 25 , 1978, IEEE Trans. Inf. Theory.

[3]  N. J. A. Sloane,et al.  Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.

[4]  Andries E. Brouwer,et al.  A few new constant weight codes , 1979 .