|
%I #35 Jan 07 2019 14:15:57
%S 1,1,1,1,2,1,1,3,2,7,1,1,1,3,13,8,938,41
%N Number of binary self-dual codes of length 2n (up to permutation equivalence) having the highest possible minimum distance.
%C Gives the number of binary self-dual codes of length 2n (up to permutation equivalence) that have the highest possible minimum distance.
%H W. Cary Huffman and Vera Pless, <a href="https://doi.org/10.1017/CBO9780511807077">Fundamentals of Error Correcting Codes</a>, Cambridge University Press, 2003, Pages 7,252-282,338-393.
%H 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.
%e The sequence A005137 says that the maximum value for the minimum distance of a binary self-dual code of length 20 is A005137(10) = 4. There are a(10)=7 binary self-dual codes of length 2*10 = 20 that have minimum distance 4.
%Y Cf. A005137.
%K nonn,more
%O 1,5
%A _Nathan J. Russell_, Nov 24 2018
|
