Maximum Likelihood Soft Decoding of Binary Block Codes and Decoders for the Golay Codes

IEEE Transactions on Information Theory

Volumn 35, Issue 5, 1989, Pages 963-975

  Snyders, Jakov ^a   Be'ery, Yair ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS;

BLOCK CODING; COSET DECODING; GOLAY CODING; MAXIMUM LIKELIHOOD DECODING; WAGNER ALGORITHM;

CODES, SYMBOLIC;

EID: 0024733559     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.42214     Document Type: Article

References (21)

1. J. H. Conway and N. J. A. Sloane, “Decoding techniques for codes and lattices, including the Golay code and the Leech lattice,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 41-50, 1986.
2. 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.
3. G. D. Forney, Jr., “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 1152-1187, 1988.
4. G. D. Forney, Jr., “Coset codes III: Ternary codes, lattices and trellis codes,” preprint.
5. R. A. Silverman and M. Balser, “Coding for a constant data rate source,” IRE Trans. Inform. Theory, vol. PG IT-4, pp. 50-63, 1954.
6. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966, pp. 61-62.
7. D. Chase, “A class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 170-182, 1972.
8. G. D. Forney, Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 363-378, 1972.
9. E. R. Berlekamp, “The technology of error-correcting codes,” Proc. IEEE, vol. 68, pp. 574-593, 1980.
10. E. R. Berlekamp, “The construction of fast, high-rate, soft decision block decoders,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 372-377, 1983.
11. 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, 1982.
12. A. D. Abbaszadeh and C. K. Rushforth, “Efficient maximum likelihood decoding of the extended Nordstrom-Robinson code,” in Proc. 25th Annu. Alierton Conf., 1987, pp. 598-599.
13. T. Y. Hwang, “Decoding linear block codes for minimizing word error rate,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 733-737, 1979.
14. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988, pp. 299-330.
15. V. Pless, “Decoding the Golay codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 561-567, 1986.
16. J. Snyders and Y. Be'ery, “Maximum likelihood decoding of block codes over GF(q) based on a Wagner rule,” submitted for publication.
17. Y. Be'ery, B. Shahar, and J. Snyders, “Fast decoding of the Leech lattice,” IEEE J. Select Areas Commun., to be published.
18. J. K. Wolf, “Efficient maximum likelihood decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, 1978.
19. D. E. Knuth, The Art of Computer Programming, vol. 3. Reading, MA: Addison-Wesley, 1973, pp. 181-195.
20. E. F. Assmus, Jr., and J. H. van Lint, “Ovals in projective designs,” J. Comb. Theory, Series A, vol. 27, pp. 307-324, 1979.
21. G. R. Lang and F. M. Longstaff, “A Leech lattice modem,” preprint.