cp's OEIS Frontend

A106166 Number of indecomposable binary self-dual codes (singly- or doubly-even) of length 2n and minimal distance exactly 4.

%I A106166 #9 May 29 2014 05:17:57
%S A106166 0,0,0,0,1,0,1,1,2,2,6,7,24,44,145,444,2441,19848
%N A106166 Number of indecomposable binary self-dual codes (singly- or doubly-even) of length 2n and minimal distance exactly 4.
%D A106166 R. T. Bilous, Enumeration of binary self-dual codes of length 34, Preprint, 2005.
%D A106166 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.
%D A106166 J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
%D A106166 V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.
%H A106166 G. Nebe, E. M. Rains and N. J. A. Sloane, <a href="http://neilsloane.com/doc/cliff2.html">Self-Dual Codes and Invariant Theory</a>, Springer, Berlin, 2006.
%H A106166 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 (<a href="http://neilsloane.com/doc/pless.txt">Abstract</a>, <a href="http://neilsloane.com/doc/pless.pdf">pdf</a>, <a href="http://neilsloane.com/doc/pless.ps">ps</a>, <a href="http://neilsloane.com/doc/plesstaba.ps">Table A</a>, <a href="http://neilsloane.com/doc/plesstabd.ps">Table D</a>).
%H A106166 E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998 (<a href="http://neilsloane.com/doc/self.txt">Abstract</a>, <a href="http://neilsloane.com/doc/self.pdf">pdf</a>, <a href="http://neilsloane.com/doc/self.ps">ps</a>).
%K A106166 nonn,hard,more
%O A106166 1,9
%A A106166 _N. J. A. Sloane_, May 09 2005
%E A106166 a(34) computed by _N. J. A. Sloane_, based on data in Bilous's paper, Sep 06 2005