A Bounded-Distance Decoding Algorithm for Lattices Obtained from a Generalized Code Formula

IEEE Transactions on Information Theory

Volumn 40, Issue 6, 1994, Pages 2075-2082

  Palazzo, Reginaldo ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Bounded distance decoding; complexity reduction; decoding; effective error correcting radius; generalized code formula; lattices; maximum likelihood; performance loss

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; TRELLIS CODES;

BOUNDED DISTANCE DECODING ALGORITHM; EFFECTIVE ERROR CORRECTING RADIUS; GENERALIZED CODE FORMULA; MAXIMUM LIKELIHOOD DECODING;

DECODING;

EID: 0028550794     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.340485     Document Type: Article

References (17)

1. Y. Be’ery, B. Sharhar and J. Snyders, “Fast decoding of the Leech lattice,’ IEEE J. Select. Areas Commun., vol. 7, pp. 959-967, Aug. 1989.
2. J. H. Conway and N. J. A. Sloane, “Fast quantizing and decoding algorithms for lattice quantizers and codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 227-232, Mar. 1982.
3. J. H. Conway and N. J. A. Sloane, “Soft decoding techniques for codes and lattices, including the Gollay code and the Leech lattice,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 41-50, Jan. 1986.
4. G. D. Forney, Jr., “Coset codes—Part II: Binary lattices and related codes,”IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
5. 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.
6. G. R. Lang and F. M. Longstaff, “A Leech lattice modem,” IEEE J. Select. Areas Commun., vol. 7, pp. 868-973, Aug. 1989.
7. J. Leech and N. J. A. Sloane, “Sphere packings and error correcting codes,” Canadian J. Math., vol. 23, pp. 718-745, 1971.
8. J. Leech, “Notes on sphere packings,” Canadian J. Math., vol. 13, pp. 251-267, 1967.
9. G. D. Forney, Jr., “Coset Codes—Part I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory, vol. 34, pp. 1123-1151, Sept. 1988.
10. H. Imai andS. Hirakawa, “Multilevel coding method using error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 371-377, May 1977.
11. S. I. Sayegh, “A class of optimum block codes in signal space,” IEEE Trans. Commun., Vol. COM-34, pp. 1043-1049, Oct. 1986.
12. V. V. Ginzburg, “Multidimensional signals for a continuous channel,” Probl. Peradach. Inform., vol. 20, pp. 28-46, 1984.
13. A. R. Calderbank, “Multilevel trellis codes and multi-stage decoding,” IEEE Trans. Commun., vol. 37, pp. 222-229, Mar. 1989.
14. G. J. Pottie and D. P. Taylor, “Multilevel codes based on partitioning,” IEEE Trans. Inform. Theory, vol. 35, pp. 87-98, Jan. 1989.
15. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
16. T. Verhoeff, “An updated table of minimum-distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 1987.
17. M. A. O. Costa e Silva, “Lattices and its partitions applied to coding on band-limited AWGN channels,” Ph.D. dissertation, State Univ. Campinas, Brazil, June 1991 (in Portuguese).