A296086 Number of binary self-dual codes of length 2n (up to permutation equivalence) having the highest possible minimum distance.

1, 1, 1, 1, 2, 1, 1, 3, 2, 7, 1, 1, 1, 3, 13, 8, 938, 41

Offset: 1

Author

Nathan J. Russell, Nov 24 2018

Keywords

• nonn
• more

Comments

Gives the number of binary self-dual codes of length 2n (up to permutation equivalence) that have the highest possible minimum distance.

Examples

			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.
		

Links

• W. Cary Huffman and Vera Pless, Fundamentals of Error Correcting Codes, Cambridge University Press, 2003, Pages 7,252-282,338-393.
• G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.

Crossrefs

Cf. A005137.