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, 2, 1, 2, 3, 4, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 3, 4, 5, 6, 7, 8

Offset

1,4

Comments

Coincides with beginning of A066016, although of course that sequence is infinite.

Links

Table of n, a(n) for n=1..24.

E. M. Rains, Bounds for self-dual codes over Z_4, Finite Fields Appl. 6 (2000), 146-163.

Crossrefs

Sequence in context: A014781 A214500 A066016 * A194070 A195183 A194841

Adjacent sequences: A098065 A098066 A098067 * A098069 A098070 A098071

Keyword

nonn,fini,full

Author

N. J. A. Sloane, Sep 13 2004

Status

approved