The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration

@article{Conway1992TheBS,
  title={The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration},
  author={John H. Conway and Vera Pless and N. J. A. Sloane},
  journal={J. Comb. Theory, Ser. A},
  year={1992},
  volume={60},
  pages={183-195}
}

Figures from this paper

On the Enumeration of Binary Self-Dual Codes
TLDR
There are 3, 210 singly-even self-dual binary codes of length 32 up to equivalence, which agrees in number with the enumeration by Bilous and van Rees, who enumerated these codes by a different method.
Self-Dual Codes over the Integers Modulo 4
A new upper bound on the minimal distance of self-dual codes
It is shown that the minimal distance d of a binary self-dual code of length n>or=74 is at most 2((n+6)/10). This bound is a consequence of some new conditions on the weight enumerator of a self-dual
An Enumeration of Binary Self-Dual Codes of Length 32
TLDR
This paper has developed algorithms that will take lists of inequivalent small codes and produce lists of larger codes where each inequivalent code occurs only a few times and finds the size of the automorphism group so that the number of distinct binary self-dual codes for a specific length is found.
On the classification and enumeration of self-dual codes
New extremal self-dual codes of lengths 36, 38, and 58
  • Jon-Lark Kim
  • Computer Science, Mathematics
    IEEE Trans. Inf. Theory
  • 2001
TLDR
New extremal self-dual binary codes of lengths 36, 38, and 58 are constructed whose weight enumerators were previously unknown.
On designs and formally self-dual codes
TLDR
This paper examines the one type of divisible [2n, n] codes which need not be self-dual and obtains a strengthening of the Assmus-Mattson theore and shows that the extremal f.s.d. even codes of lengths 10 and 18 are unique.
Optimum Subcodes of Self-Dual Codes and Their Optimum Distance Profiles
TLDR
This paper determines the optimum distance profiles (ODPs) of linear codes, finds a first example of a doubly-even self-complementary $[48, 16, 16]$ code, and shows that there does not exist a subcode of $q_{48}$ for $k \ge 17$.
Classification of Type IV Self-Dual Z4-Codes of Length 16
TLDR
A method to classify Type IV self-dual codes over Z4 of length 16 is given and there are exactly 11 inequivalent Type IVself-duAL Z4-codes of length16.
Optimal subcodes and optimum distance profiles of self-dual codes
...
...

References

SHOWING 1-10 OF 20 REFERENCES
On the Enumeration of Self-Dual Codes
On the Classification and Enumeration of Self-Dual Codes
A new upper bound on the minimal distance of self-dual codes
It is shown that the minimal distance d of a binary self-dual code of length n>or=74 is at most 2((n+6)/10). This bound is a consequence of some new conditions on the weight enumerator of a self-dual
On self-dual, doubly even codes of length 32
  • H. Koch
  • Mathematics
    J. Comb. Theory, Ser. A
  • 1989
Theory of Error-correcting Codes
TLDR
This course expounds the principles of coded modulations for the Gaussian channel and, if time permits, for Rician and Rayleigh fading channels (fully interleaved), and reminds students of the basics of the theory of linear codes for conventional memoryless ergodic channels.
A new combinatorial approach to M24
  • R. Curtis
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1976
In this paper, we define M24 from scratch as the subgroup of S24 preserving a Steiner system S(5, 8, 24). The Steiner system is produced and proved to be unique and the group emerges naturally with
Sphere Packings, Lattices and Groups
nauty User ’ s Guide ( Version 2 . 4 )
0. How to use this Guide.
The children of the (32, 16) doubly even codes
  • V. Pless
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1978
Generator matrices, weight distributions, and automorphism groups are given for all (26,13,6), (28,14,6), and (30,15,6) binary self-dual codes. These results are obtained from the earlier enumeration
ATLAS of Finite Groups
...
...