cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A215219 Number of (indecomposable or decomposable) Type II binary self-dual codes of length 8n with the highest minimal distance.

Original entry on oeis.org

1, 1, 2, 1, 5, 16470, 1
Offset: 0

Views

Author

N. J. A. Sloane, Aug 08 2012

Keywords

Comments

It is important to distinguish between "extremal" (meaning having the highest possible minimal distance permitted by Gleason's theorem) and "optimal" (meaning having the highest minimal distance that can actually be achieved). This sequence enumerates optimal codes. Extremal codes do not exist when n is sufficiently large. For lengths up to at least 64, "extremal" and "optimal" coincide.
"There are 94343 inequivalent doubly even self-dual codes of length 40, 16470 of which are extremal." [Betsumiya et al.] - Jonathan Vos Post, Aug 06 2012

Crossrefs

Extensions

a(6) = 1 (due to Houghten et al.) from Akihiro Munemasa, Aug 08 2012