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

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

Offset

5,1

Comments

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

References

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.

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

Links

Table of n, a(n) for n=5..11.

M. Grassl, Bounds on the minimum distance of linear codes

Example

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

Crossrefs

Cf. A169762, A005865.

Sequence in context: A186079 A022938 A048585 * A049304 A168614 A045014

Adjacent sequences: A169758 A169759 A169760 * A169762 A169763 A169764

Keyword

nonn,more

Author

N. J. A. Sloane, May 08 2010

Status

approved