The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (5) , 1686-1693
- https://doi.org/10.1109/18.333895
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Fast Bounded-Distance Decoding of the Nordstrom-Robinson CodePublished by Springer Nature ,1994
- Maximum likelihood decoding of the Leech latticeIEEE Transactions on Information Theory, 1993
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1993
- Note on the complete decoding of Kerdock codesIEE Proceedings I Communications, Speech and Vision, 1992
- More efficient soft decoding of the Golay codesIEEE Transactions on Information Theory, 1991
- Orbit and coset analysis of the Golay and related codesIEEE Transactions on Information Theory, 1990
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- Coding theory and the Mathieu groupsInformation and Control, 1971