login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A003178
Number of indecomposable self-dual binary codes of length 2n.
(Formerly M0356)
11
1, 1, 0, 0, 1, 0, 1, 1, 2, 2, 6, 8, 26, 45, 148, 457, 2523, 20786
OFFSET
0,9
REFERENCES
R. T. Bilous, Enumeration of binary self-dual codes of length 34, Preprint, 2005.
R. T. Bilous and G. H. J. van Rees, An enumeration of binary self-dual codes of length 32, Designs, Codes Crypt., 26 (2002), 61-86.
J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.
J. H. Conway, V. Pless and N. J. A. Sloane, The Binary Self-Dual Codes of Length Up to 32: A Revised Enumeration, J. Comb. Theory, A28 (1980), 26-53 (Abstract, pdf, ps, Table A, Table D).
E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998 (Abstract, pdf, ps).
CROSSREFS
Sequence in context: A197465 A074933 A157253 * A079494 A169970 A334499
KEYWORD
nonn,hard,more,nice
EXTENSIONS
a(16) corrected and a(17) added by N. J. A. Sloane, based on data in Bilous's paper, Sep 06 2005
STATUS
approved