|
|
A098068
|
|
If C is a doubly-even binary code of length N=24m+n, 1 <= n <= 24, then the minimum distance of C^perp is bounded above by 4m+a(n).
|
|
1
|
|
|
1, 1, 1, 2, 1, 2, 3, 4, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 3, 4, 5, 6, 7, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Coincides with beginning of A066016, although of course that sequence is infinite.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|