login
A106166
Number of indecomposable binary self-dual codes (singly- or doubly-even) of length 2n and minimal distance exactly 4.
2
0, 0, 0, 0, 1, 0, 1, 1, 2, 2, 6, 7, 24, 44, 145, 444, 2441, 19848
OFFSET
1,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.
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: A357953 A283824 A106168 * A374330 A101343 A284748
KEYWORD
nonn,hard,more
AUTHOR
N. J. A. Sloane, May 09 2005
EXTENSIONS
a(34) computed by N. J. A. Sloane, based on data in Bilous's paper, Sep 06 2005
STATUS
approved