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.

Showing 1-4 of 4 results.

A105682 Highest minimal Euclidean norm of any Type 4^Z self-dual code of length n over Z/4Z.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, May 06 2005

Keywords

Crossrefs

A105689 gives number of such codes. Cf. also A066014.

A066012 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 A105681.

Original entry on oeis.org

2, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 6, 6, 8, 6, 8, 6, 8, 8, 8, 10, 10
Offset: 1

Views

Author

N. J. A. Sloane, Dec 11 2001

Keywords

Crossrefs

Cf. A066013 for number of codes. See also A066014-A066017.

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.

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.
Showing 1-4 of 4 results.