login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110860 Number of even formally self-dual (but not self-dual) binary codes of length 2n that have the highest possible minimal distance. 0

%I

%S 0,0,1,0,1,2,9,141

%N Number of even formally self-dual (but not self-dual) binary codes of length 2n that have the highest possible minimal distance.

%H W. C. Huffman, <a href="https://doi.org/10.1016/j.ffa.2005.05.012">On the classification and enumeration of self-dual codes</a>, Finite Fields Applic., 11 (2005), 451-490.

%K nonn,more

%O 1,6

%A _N. J. A. Sloane_, Sep 19 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 04:15 EDT 2020. Contains 334859 sequences. (Running on oeis4.)