The Leech Lattice and the Golay Code: Bounded-Distance Decoding and Multilevel Constructions

IEEE Transactions on Information Theory

Volumn 40, Issue 4, 1994, Pages 1030-1043

  Amrani, Ofer ^a   Be'ery, Yair ^a   Vardy, Alexander ^b   van Tilborg, Henk C A ^c   Sun, Feng Wen ^c  

^a TEL AVIV UNIVERSITY   (Israel)

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

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

bounded distance decoding; Golay code; Leech lattice; multilevel constructions

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; ERROR CORRECTION; ERRORS; INFORMATION THEORY; PERFORMANCE;

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; BOUNDED DISTANCE DECODER; BOUNDED DISTANCE DECODING; GOLAY CODE; LEECH LATTICE; LOSS IN CODING GAIN; MAXIMUM LIKELIHOOD DECODER; MULTILEVEL CONSTRUCTIONS;

CODES (SYMBOLS);

EID: 0028461652     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.335970     Document Type: Article

References (24)

1. A. D. Abbaszadeh and C. K. Rushforth, “VLSI implementation of a maximum likelihood decoder for the Golay (24,12) code,” IEEE J. Select. Areas Commun., vol. 6, pp. 558-565, 1988.
2. E. F. Assmus, Jr. and H. F. Mattson, Jr., “Algebraic theory of codes,” Report No. 1, Contract No. F19628-69C0068, Air Force Cambridge Research Labs., Bedford, MA., 1969.
3. Y. Be'ery and B. Shahar, “VLSI architectures for soft decoding of the Leech lattice and the Golay codes,” in Proc. IEEE Int. Workshop on Microelectronics in Communication (Interlaken, Switzerland), March 1991.
4. Y. Be'ery, B. Shahar, and J. Snyders, “Fast decoding of the Leech lattice,” IEEE J. Select. Areas Commun., vol. 7, pp. 959-967, 1989.
5. Y. Be'ery and J. Snyders, “Optimal soft decision block decoders based on Fast Hadamard Transform,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 355-364, 1986.
6. J. H. Conway and N. J. A. Sloane, “Twenty-three constructions for the Leech lattice,” Proc. R. Soc., Ser. A, vol. 381, pp. 275-283, 1982.
7. 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. 32, pp. 41-50, 1986.
8. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
9. G. D. Forney, Jr., “Coset codes I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory, vol. 34, pp. 1123-1151, 1988.
10. G. D. Forney, Jr., “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
11. G. D. Forney, Jr., “A bounded distance decoding algorithm for the Leech lattice, with generalizations,” IEEE Trans. Inform. Theory, vol. 35, pp. 906-909, 1989.
12. G. D. Forney, Jr., R. G. Gallager, G. R. Lang, F. M. Longstaff, and S. U. Qureshi, “Efficient modulation for band-limited channels,” IEEE J. Select. Areas Commun., vol. 2, pp. 632-646, 1984.
13. H. Imai and S. Hirakawa, “Multilevel coding method using error-correcting codes,” IEEE Trans. Inform. Theory, vol. 23, pp. 371-377, 1977.
14. G. R. Lang and F. M. Longstaff, “A Leech lattice modem,” IEEE J. Select. Areas Commun., vol. 7, pp. 968-973, 1989.
15. J. Leech, “Notes on sphere packings,” Can. J. Math., vol. 19, pp. 251-267, 1967.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
17. V. Pless, “Decoding the Golay codes,” IEEE Trans. Inform. Theory, vol. 32, pp. 561-567, 1986.
18. V. Pless and N. J. A. Sloane, “On the classification of self dual codes,” J. Comb. Theory, vol. 18A, pp. 313-335,1975.
19. M. Ran and J. Snyders, “On maximum likelihood soft decoding of some binary self-dual codes,” IEEE Trans. Commun., vol. 41, pp. 439-443, 1993.
20. R. A. Silverman and M. Balser, “Coding for a constant data rate source,” IRE Trans. Inform. Theory, vol. 4, pp. 50-63, 1954.
21. 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, 1989.
22. A. Vardy, “The Nordstrom-Robinson code: Representation over GF(4) and efficient decoding,” IEEE Trans. Inform. Theory, vol. 40, September 1994 (to appear).
23. A. Vardy and Y. Be'ery, “More efficient soft-decision decoding of the Golay codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 667-672, 1991.
24. A. Vardy and Y. Be'ery, “Maximum-likelihood decoding of the Leech lattice,” to appear in IEEE Trans. Inform. Theory, vol. 39, pp. 1435-1444, July,1993.