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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105687 Number of inequivalent codes attaining highest minimal Hamming distance of any Type 4^H+ Hermitian additive self-dual code over GF(4) of length n. 2
1, 1, 1, 3, 1, 1, 4, 5, 8, 120, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

C. Bachoc and P. Gaborit, On extremal additive F_4 codes of length 10 to 18, in International Workshop on Coding and Cryptography (Paris, 2001), Electron. Notes Discrete Math. 6 (2001), 10 pp.

P. Gaborit, W. C. Huffman, J.-L. Kim and V. S. Pless, On additive GF(4) codes, in Codes and Association Schemes (Piscataway, NJ, 1999), A. Barg and S. Litsyn, eds., Amer. Math. Soc., Providence, RI, 2001, pp. 135-149.

G. Hoehn, Self-dual codes over the Kleinian four-group, Math. Ann. 327 (2003), 227-255.

LINKS

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

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

A. R. Calderbank, E. M. Rains, P. W. Shor and N. J. A. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inform. Theory, 44 (1998), 1369-1387.

L. E. Danielsen, Database of Self-Dual Quantum Codes.

L. E. Danielsen and M. G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12, preprint, 2005.

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

CROSSREFS

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

A016729 gives the minimal distance of these codes.

A094927 gives the number of inequivalent codes of any distance.

Sequence in context: A131238 A133380 A343168 * A209415 A058879 A208344

Adjacent sequences:  A105684 A105685 A105686 * A105688 A105689 A105690

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 06 2005

EXTENSIONS

Corrected and extended to 12 terms by Lars Eirik Danielsen (larsed(AT)ii.uib.no) and Matthew G. Parker (matthew(AT)ii.uib.no), Jun 30 2005

STATUS

approved

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 8 20:37 EST 2021. Contains 349596 sequences. (Running on oeis4.)