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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001647 Number of indecomposable self-dual codes of length 2n over GF(4). 0

%I

%S 1,0,1,1,2,4,10,31

%N Number of indecomposable self-dual codes of length 2n over GF(4).

%H J. Conway, V. Pless, N. Sloane, <a href="https://doi.org/10.1109/TIT.1979.1056047">Self-dual codes over GF(3) and GF(4)of length not exceeding 16</a>, IEEE Trans. Information Theory 25 312-322 1979.

%H F. J. MacWilliams, A. M. Odlyzko, N. J. A. Sloane and H. N. Ward, <a href="https://doi.org/10.1016/0097-3165(78)90021-3">Self-Dual Codes over GF(4)</a>, J. Combin. Theory, A 25 288-318 1978.

%H 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 nonn,hard,nice

%O 1,5

%A _N. J. A. Sloane_.

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 January 22 22:16 EST 2020. Contains 331166 sequences. (Running on oeis4.)