login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005137 Highest minimal distance of self-dual code of length 2n.
(Formerly M0233)
0
0, 2, 2, 2, 4, 2, 4, 4, 4, 4, 4, 6, 8, 6, 6, 6, 8, 6, 8, 8, 8, 8, 8, 10, 12, 10, 10, 10, 12, 10, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

J. H. Conway and N. J. A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory, 36 (1990), 1319-1334.

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. xxiv.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=0..30.

CROSSREFS

Sequence in context: A066012 A063375 A064129 * A222959 A220498 A105681

Adjacent sequences:  A005134 A005135 A005136 * A005138 A005139 A005140

KEYWORD

nonn,hard

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 22 11:50 EST 2018. Contains 299452 sequences. (Running on oeis4.)