|
|
A105674
|
|
Highest minimal distance of any Type I (strictly) singly-even binary self-dual code of length 2n.
|
|
19
|
|
|
2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 8, 6, 8, 8, 8, 8, 8, 10, 10, 10, 10, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence continues: a(28) = either 10 or 12, then a(58) = 10, a(60) through a(68) = 12, ...
|
|
REFERENCES
|
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1977.
|
|
LINKS
|
E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998; (Abstract, pdf, ps).
|
|
EXAMPLE
|
At length 8 the only strictly Type I self-dual code is {00,11}^4, which has d=2, so a(4) = 2.
|
|
CROSSREFS
|
Cf. also A105685 for the number of such codes.
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|