|
| |
|
|
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; 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).
|
|
|
CROSSREFS
| Sequence in context: A066012 A063375 A064129 * A105681 A130127 A184727
Adjacent sequences: A005134 A005135 A005136 * A005138 A005139 A005140
|
|
|
KEYWORD
| nonn,hard
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
