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.

Previous Showing 11-19 of 19 results.

A066014 Highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105682.

Original entry on oeis.org

4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 8, 4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 12, 12
Offset: 1

Views

Author

N. J. A. Sloane, Dec 12 2001; revised May 06 2005

Keywords

Crossrefs

Cf. A066015 for number of codes. See also A066012-A066017.

A105685 Number of inequivalent codes attaining highest minimal distance of any Type I (strictly) singly-even binary self-dual code of length 2n.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 2, 7, 1, 1, 1, 3, 13, 3
Offset: 1

Views

Author

N. J. A. Sloane, May 06 2005, Aug 23 2008

Keywords

Examples

			At length 8 the only strictly Type I self-dual code is {00,11}^4, so a(4) = 1.
		

References

  • J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
  • F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1977.
  • V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.

Crossrefs

A105674 gives the minimal distance of these codes, A106165 the number of codes of any minimal distance and A003179 the number of inequivalent codes allowing Type I or Type II and any minimal distance.

A066015 Number of codes having highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105682.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 4, 6, 11, 16, 19, 19, 66, 35, 28
Offset: 1

Views

Author

N. J. A. Sloane, Dec 12 2001; revised May 06 2005

Keywords

Crossrefs

Cf. A066014 for minimal weight. See also A066012-A066017.

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

A105688 Number of codes having highest minimal Lee distance of any Type 4^Z self-dual code of length n over Z/4Z.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 11, 5, 3, 39, 8, 1, 15
Offset: 1

Views

Author

N. J. A. Sloane, Dec 11 2001

Keywords

Crossrefs

Cf. A105681 for minimal Lee distances of these codes. See also A066012-A066017.

A105689 Number of codes having highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 4, 1, 11, 16, 19, 19, 66, 35, 28
Offset: 1

Views

Author

N. J. A. Sloane, Dec 12 2001

Keywords

Comments

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

Crossrefs

Cf. A105682 for minimal distance. See also A066012-A066017.

A066013 Number of codes having highest minimal Lee distance of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105688.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 11, 5, 3, 39, 8, 1, 15
Offset: 1

Views

Author

N. J. A. Sloane, Dec 11 2001; revised May 06 2005

Keywords

Crossrefs

Cf. A066012 for minimal Lee distances of these codes. See also A066014-A066017.

A105686 Number of inequivalent codes attaining highest minimal Hamming distance of any Type 4^H Hermitian linear self-dual code over GF(4) of length 2n.

Original entry on oeis.org

1, 1, 1, 1, 2, 5, 1, 4, 1, 2
Offset: 1

Views

Author

N. J. A. Sloane, May 06 2005

Keywords

Crossrefs

A105678 gives the minimal distance of these codes.

A106169 Number of inequivalent codes attaining highest minimal Hamming distance of any Type (4_II)^H+ even Hermitian additive self-dual code over GF(4) of length 2n.

Original entry on oeis.org

1, 2, 1, 3, 19, 1, 1020
Offset: 1

Views

Author

N. J. A. Sloane, May 09 2005

Keywords

Comments

The minimal distance of these codes is (so far) 2,2,4,4,4,6.

Crossrefs

Previous Showing 11-19 of 19 results.