This site is supported by donations to The OEIS Foundation.



Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105689 Number of codes having highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z. 2
1, 1, 1, 2, 2, 3, 4, 1, 11, 16, 19, 19, 66, 35, 28 (list; graph; refs; listen; history; text; internal format)



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


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

S. T. Dougherty, M. Harada and P. Sole', 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. A105682 for minimal distance. See also A066012-A066017.

Sequence in context: A008951 A119473 A002122 * A187200 A117632 A236241

Adjacent sequences:  A105686 A105687 A105688 * A105690 A105691 A105692




N. J. A. Sloane, Dec 12 2001



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 December 5 10:45 EST 2019. Contains 329751 sequences. (Running on oeis4.)