Orbit and coset analysis of the Golay and related codes
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (5) , 1038-1050
- https://doi.org/10.1109/18.57203
Abstract
Let b be a code of length n over a field F , with automorphism group G; bw denotes the subset of codewords of weight w. The goal is to classify the vectors of Fn into orbits under G and to determine their distances from the various subcodes b w. This is done for the first-order Reed-Muller, Nordstrom-Robinson, and Hamming codes of length 16, the Golay and shortened Golay codes of lengths 22, 23, 24, and the ternary Golay code of length 12Keywords
This publication has 8 references indexed in Scilit:
- A new table of constant weight codesIEEE Transactions on Information Theory, 1990
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988
- Lexicographic codes: Error-correcting codes from game theoryIEEE Transactions on Information Theory, 1986
- Laminated LatticesAnnals of Mathematics, 1982
- The covering radius of the Leech latticeProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1982
- A new combinatorial approach to M24Mathematical Proceedings of the Cambridge Philosophical Society, 1976
- On subgroups of ·0. I. Lattice stabilizersJournal of Algebra, 1973
- A representation of the Mathieu groupM 24 as a collineation groupAnnali di Matematica Pura ed Applicata (1923 -), 1966