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-6 of 6 results.

A106162 Number of indecomposable Type II binary self-dual codes of length 8n.

Original entry on oeis.org

1, 1, 1, 7, 75, 94251
Offset: 0

Views

Author

N. J. A. Sloane, May 09 2005

Keywords

References

  • J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
  • V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.

Crossrefs

Extensions

a(4) corrected by John van Rees, Jul 21 2005. It was given as 76 by Conway and Pless and as 74 by Rains and Sloane.
a(5) = 94251 = 94343 - 75 - 7 - 7 - 1 - 1 - 1 (cf. A106163) from Koichi Betsumaya, Aug 11 2012

A106163 Total number of (indecomposable or decomposable) Type II binary self-dual codes of length 8n.

Original entry on oeis.org

1, 1, 2, 9, 85, 94343
Offset: 0

Views

Author

N. J. A. Sloane, May 09 2005

Keywords

Comments

"There are 94343 inequivalent doubly even self-dual codes of length 40, 16470 of which are extremal" [Betsumiya et al.] - Jonathan Vos Post, Aug 06 2012

Crossrefs

A106165 Number of inequivalent (indecomposable or decomposable) Type I but not Type II binary self-dual codes of length 2n.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 3, 4, 5, 9, 16, 25, 46, 103, 261, 731, 3210, 24147
Offset: 0

Views

Author

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

Keywords

Comments

The minimal distance of these codes is not constrained. A105685 gives the number with the highest minimal distance.

Crossrefs

A106164 Number of indecomposable Type I but not Type II binary self-dual codes of length 2n.

Original entry on oeis.org

0, 1, 0, 0, 0, 0, 1, 1, 1, 2, 6, 8, 19, 45, 148, 457, 2448, 20786
Offset: 0

Views

Author

N. J. A. Sloane, May 09 2005

Keywords

References

  • R. T. Bilous, Enumeration of binary self-dual codes of length 34, Preprint, 2005.
  • R. T. Bilous and G. H. J. van Rees, An enumeration of binary self-dual codes of length 32, Designs, Codes Crypt., 26 (2002), 61-86.
  • J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
  • V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.

Crossrefs

Extensions

a(34) computed by N. J. A. Sloane, based on data in Bilous's paper, Sep 06 2005

A215219 Number of (indecomposable or decomposable) Type II binary self-dual codes of length 8n with the highest minimal distance.

Original entry on oeis.org

1, 1, 2, 1, 5, 16470, 1
Offset: 0

Views

Author

N. J. A. Sloane, Aug 08 2012

Keywords

Comments

It is important to distinguish between "extremal" (meaning having the highest possible minimal distance permitted by Gleason's theorem) and "optimal" (meaning having the highest minimal distance that can actually be achieved). This sequence enumerates optimal codes. Extremal codes do not exist when n is sufficiently large. For lengths up to at least 64, "extremal" and "optimal" coincide.
"There are 94343 inequivalent doubly even self-dual codes of length 40, 16470 of which are extremal." [Betsumiya et al.] - Jonathan Vos Post, Aug 06 2012

Crossrefs

Extensions

a(6) = 1 (due to Houghten et al.) from Akihiro Munemasa, Aug 08 2012

A110193 Number of (indecomposable or decomposable) binary self-dual codes (singly- or doubly-even) of length 2n and minimal distance exactly 6.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 3, 13, 74, 938
Offset: 1

Views

Author

N. J. A. Sloane, Sep 06 2005

Keywords

Comments

In fact all such codes of length <= 42 are indecomposable.

References

  • R. T. Bilous, Enumeration of binary self-dual codes of length 34, Preprint, 2005.
  • R. T. Bilous and G. H. J. van Rees, An enumeration of binary self-dual codes of length 32, Designs, Codes Crypt., 26 (2002), 61-86.
  • J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
  • V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.

Crossrefs

Showing 1-6 of 6 results.