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



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066017 Number of inequivalent codes attaining highest minimal Hamming distance of any Type 4^Z self-dual code of length n over Z/4Z. 8
1, 1, 1, 1, 2, 1, 1, 1, 11, 5, 3, 39, 8, 4, 47 (list; graph; refs; listen; history; text; internal format)



There are two versions of this sequence, this and A111259. I am not sure which is correct.


Table of n, a(n) for n=1..15.

S. T. Dougherty, M. Harada and P. Solé, Shadow Codes over Z_4, Finite Fields Applic., 7 (2001), 507-529.

P. Gaborit, Tables of Self-Dual Codes

W. C. Huffman, On the classification and enumeration of self-dual codes, Finite Fields Applic., 11 (2005), 451-490.

G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.

E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998; (Abstract, pdf, ps).


Cf. A105674, A105675, A105676, A105677, A105678, A016729, A066016, A105681, A105682.

Cf. A066015 for minimal distance. See also A066012-A066016.

Sequence in context: A007737 A229243 A105688 * A236938 A079834 A342458

Adjacent sequences:  A066014 A066015 A066016 * A066018 A066019 A066020




N. J. A. Sloane, Dec 12 2001; revised May 06 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 September 19 07:08 EDT 2021. Contains 347554 sequences. (Running on oeis4.)