Coding theory and the Mathieu groups

DOI10.1016/S0019-9958(71)90295-6MaRDI QIDQ5621304zbMATH OpenFDO

Authors Elwyn R. Berlekamp

Publication date 1971

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(71)90295-6

Mathematics Subject Classification ID

Multiply transitive finite groups (20B20) Cyclic codes (94B15) Combinatorial codes (94B25)

Cited in

(15)

• Few-cosine spherical codes and Barnes-Wall lattices
• The Automorphism Groups of the Kerdock Codes
• Difference sets in noncyclic Abelian groups
• Algebraic theory of block codes detecting independent errors
• Build a sporadic group in your basement
• On the classification and enumeration of self-dual codes
• On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
• New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems
• On weights in quadratic-residue codes
• A survey of constructive coding theory, and a table of binary codes of highest known rate
• A note on regular subgroups of the automorphism group of the linear Hadamard code
• The automorphism groups of the Delsarte-Goethals codes
• On the Mathieu groups \(M_ 22, M_ 23, M_ 24\) and the uniqueness of the assoiated Steiner system
• On the automorphism groups of the \(\mathbb Z_2\mathbb Z_4\)-linear 1-perfect and Preparata-like codes
• On the structure of the linear codes with a given automorphism

This page was built for publication: Coding theory and the Mathieu groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5621304)