login
Consider binary linear [N,K,D] codes with D=6 and redundancy R = N-K = n; a(n) = maximal value of N.
2

%I #5 Mar 16 2013 11:15:23

%S 6,7,9,12,18,24,34

%N Consider binary linear [N,K,D] codes with D=6 and redundancy R = N-K = n; a(n) = maximal value of N.

%C A binary linear [N,K,D] code has length N, dimension K and minimal distance D.

%D A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, New table of constant weight codes, IEEE Trans. Info. Theory 36 (1990), 1334-1380.

%D F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978.

%H M. Grassl, <a href="http://www.codetables.de/">Bounds on the minimum distance of linear codes</a>

%e a(9) = 18 corresponds to the [18,9,6] extended quadratic residue code.

%Y Cf. A169762, A005865.

%K nonn,more

%O 5,1

%A _N. J. A. Sloane_, May 08 2010