Maximum likelihood decoding of the Leech lattice
- 1 July 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (4) , 1435-1444
- https://doi.org/10.1109/18.243466
Abstract
An algorithm for maximum likelihood decoding of the Leech lattice is presented. The algorithm involves projecting the points of the Leech lattice directly onto the codewords of the (6,3,4) quaternary code-the hexacode. Projection on the hexacode induces a partition of the Leech lattice into four cosets of a certain sublattice 24. Such a partition into cosets enables maximum likelihood decoding of the Leech lattice with 3595 real operations in the worst case and only 2955 operations on the average. This is about half the worst case and the average complexity of the best previously known algorithmKeywords
This publication has 22 references indexed in Scilit:
- Some optimal codes have structureIEEE Journal on Selected Areas in Communications, 1989
- A Leech lattice modemIEEE Journal on Selected Areas in Communications, 1989
- A bounded-distance decoding algorithm for the Leech lattice, with generalizationsIEEE Transactions on Information Theory, 1989
- Coset codes. I. Introduction and geometrical classificationIEEE Transactions on Information Theory, 1988
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988
- Efficient Modulation for Band-Limited ChannelsIEEE Journal on Selected Areas in Communications, 1984
- A new combinatorial approach to M24Mathematical Proceedings of the Cambridge Philosophical Society, 1976
- Codes with simple automorphism groupsArchiv der Mathematik, 1971
- Notes on Sphere PackingsCanadian Journal of Mathematics, 1967