On the Golay perfect binary code
From MaRDI portal
Publication:2532761
DOI10.1016/0097-3165(71)90043-4zbMath0174.50801OpenAlexW2010633994MaRDI QIDQ2532761
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(71)90043-4
Related Items
Nordstrom-Robinson code and \(A_7\)-geometry, Algebraic theory of block codes detecting independent errors, Few-cosine spherical codes and Barnes-Wall lattices, Weight enumerators of self-orthogonal codes, A survey of constructive coding theory, and a table of binary codes of highest known rate
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect codes and the Mathieu groups
- A simple group of order 44,352,000
- A Note on the Mathieu Groups
- On t-Designs and Groups
- Power moment identities on weight distributions in error correcting codes
- An optimum nonlinear code
- Disjoint Steiner systems associated with the Mathieu groups
- Weight and distance structure of Nordstrom-Robinson quadratic code
- On the uniqueness of the Golay codes
- A PERFECT GROUP OF ORDER 8,315,553,613,086,720,000 AND THE SPORADIC SIMPLE GROUPS
- On tactical configurations and error-correcting codes
- Strongly Regular Graphs Derived from Combinatorial Designs
- A new look at the Golay (23, 12) code (Corresp.)
