Maximum Likelihood Decoding of the Leech Lattice

IEEE Transactions on Information Theory

Volumn 39, Issue 4, 1993, Pages 1435-1444

  Be’ery, Yair ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

binary Golay code; hexacode; lattice codes; Leech; Leech lattice; maximum likelihood decoding; quarter lattice

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECODING; MATRIX ALGEBRA; VECTORS;

BINARY GOLAY CODE; HEXACODE; LATTICE CODES; LEECH LATTICE; LEECH QUARTER LATTICE; MAXIMUM LIKELIHOOD DECODING;

CODES (SYMBOLS);

EID: 0027634536     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.243466     Document Type: Article

References (28)

1. J. P. Adoul and M. Barth, “Nearest neighbor algorithm for spherical codes from the Leech lattice,” IEEE Trans. Inform. Theory, vol. 34, pt. II, 1188–1202, Sept. 1988.
2. Y. Be'ery and B. Shahar, “VLSI Architectures for soft decoding of the Leech lattice and the Go lay codes,” Proc. IEEE Int. Workshop on Microelectronics in COMMUTL, Interlaken, Switzerland, Mar. 1991.
3. Y. Be’ery, B. Shahar, and J. Snyders “Fast decoding of the Leech lattice,” IEEE J. Select. Areas Commun., vol. 7, 959–967, 1989.
4. J. W. M. Bergmans, S. A. Rajput, and F. A. M. Van de Lear, “Codesigned coding, modulation and equalization,” preprint.
5. A. R. Calderbank and N. J. A. Sloane, “New trellis codes based on lattices and enacts,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 177–195, Mar. 1987.
6. J. H. Conway, “Hexacode and tetracode—MOG and MINIMOG,” in New York: Academic Press, Computational Group Theory, 1984, pp. 359–365.
7. J. H. Conway and N. J. A. Sloane, “Voronoi regions of lattices, second moments of polytopes, and quantization,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 211–226, 1982.
8. J. H. Conway and N. J. A. Sloane, “On the Voronoi regions of certain lattices”, SIAM J. Algebraic Discrete Methods, vol. 5, pp. 294–305, 1984.
9. J. H. Conway and N. J. A. Sloane, “Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 41–50, Jan. 1986.
10. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, Verlag, 1988.
11. R. T. Curtis, “A new combinatorial approach to M24,” Math Proc. Camb. Phil. Soc., vol. 79, pp. 25–41, 1976.
12. R. de Buda, “Some optimal codes have structure,” IEEE.I. Select. Areas Commun., vol. 7, 959–967, 1989.
13. G. D. Forney, Jr., “Coset codes I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory, vol. 34, Pt. II, pp. 1123–1151, Sept. 1988.
14. G. D. Forney, Jr., “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pt. II pp. 1152–1187, Sept. 1988.
15. G. D. Forney, Jr., “A bounded distance decoding algorithm for the Leech lattice, with generalizations,” IEEE Trans. Inform. Theory, vol. 35, pp. 906–909, July 1989.
16. G. D. Forney, Jr., R. G. Gallager, G. R. Lang, F. M. Long staff, and S. U. Qureshi, “Efficient modulation for band-limited channels,” IEEE J. ‘Select. Areas Commun., vol. SAC-2, pp. 632–647, 1984.
17. D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
18. G. R Lang and F. M. Long staff, “A Leech lattice modem,” IEEE J. Select Areas Commun., vol. 7, pp. 968–973, 1989.
19. J. Leech, “Notes on sphere packing,” Can. J. Math., vol. 19, pp. 251–267, 1967.
20. R. E. Peile, Final report on INTEL-963: “Codesigned coding, modulation and equilization,” preprint.
21. V. S. Pless, “Decoding the Golay codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 561–567, July 1986.
22. R. A. Silverman and M. Balser, “Coding for a constant data rate source,” IRE Trans. Inform. Theory, vol. IT-4, pp. 50–63, 1954.
23. N. J. A. Sloane, “Tables of sphere packings and spherical codes,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 327–338, 1981.
24. J. Snyders and Y. Be’ery, “Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 963–975, Sept. 1989.
25. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 55–67, Jan. 1982.
26. A. Vardy and Y. Be’ery, “More efficient soft-decision decoding of the Golay codes,” IEEE Trans. Inform. Theory, vol. 37, pt. I, pp. 667–672, May 1991.
27. E. F. Assmus, Jr. and H. F. Mattson, Jr., “Algebraic theory of codes II,” Scientific Rep. No. 1, Contract No. F19628-69-C-0068, Air Force Cambridge Research Labs., 1969.
28. E. P. Shaughnessy, “Codes with simple automorphism groups,” Arch. Math. (Basel), vol. 22, pp. 459–466, 1971.