cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 4, 5, 8, 120, 1, 1
Offset: 1

Views

Author

N. J. A. Sloane, May 06 2005

Keywords

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.

Crossrefs

A016729 gives the minimal distance of these codes.
A094927 gives the number of inequivalent codes of any distance.

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