An enumeration of binary self-dual codes of length 32
The authors provide several algorithms to enumerate binary self-dual codes recursively. The first algorithm computes the \((2k,k,2)\) self-dual codes from the \((2j,j)\) self-dual codes \((j\leq k-1)\). The next one takes the list of \((2j,j,d\geq 4)\) self-dual codes \((j\leq k-2)\) and produces a list of all inequivalent \((2k,k,4)\) self-dual codes. The third algorithm takes a subset of the codes produced by the second algorithm to produce a list of inequivalent \((2k,k,d\geq 6)\) self-dual codes. As the algorithms also deliver the size of the automorphism groups for each code, it was possible to check that the list contains the correct number of codes. The paper concludes with a list of the weight enumerators and size of the automorphism groups for self-dual codes of length 32, extending results of \textit{J. H. Conway} and \textit{V. Pless} [J. Comb. Theory, Ser. A 28, 26-53 (1980; Zbl 0439.94011)] and \textit{J. H. Conway}, \textit{V. Pless} and \textit{N. J. A. Sloane} [ibid. 60, 183-195 (1992; Zbl 0751.94009)] for the binary doubly-even self-dual codes of length 32. It also proves a conjecture of \textit{J. H. Conway} and \textit{N. J. A. Sloane} [ibid. 36, 1319-1333 (1990; Zbl 0713.94016)], which states that the smallest possible length for a binary self-dual code whose full automorphism group has size 1 is 34.
- Self-dual codes over F₂ +u F₂ with an automorphism of odd order
- The binary self-dual codes of length up to 32: A revised enumeration
- Designs and self-dual codes with long shadows.
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- Eigenvalues and critical groups of Adinkras
- On graphs and codes preserved by edge local complementation
- Classification of binary self-orthogonal codes of lengths from 16 to 20 and its application
- Computer based reconstruction of binary extremal self-dual codes of length 32
- scientific article; zbMATH DE number 493079 (Why is no real title available?)
- scientific article; zbMATH DE number 5175633 (Why is no real title available?)
- On the classification and enumeration of self-dual codes
- Replicable functions arising from code-lattice VOAs fixed by automorphisms
- Averaging over codes and an SU(2) modular bootstrap
- Self-orthogonal cyclic codes with good parameters
- Homomorphisms from the Coxeter graph
- Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
- New constructions of optimal self-dual binary codes of length 54
- On the existence of certain optimal self-dual codes with lengths between 74 and 116
This page was built for publication: An enumeration of binary self-dual codes of length 32
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611355)
