Reduced Lists of Error Patterns for Maximum Likelihood Soft Decoding

IEEE Transactions on Information Theory

Volumn 37, Issue 4, 1991, Pages 1194-1200

  Snyders, Jakov ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

binary block codes; maximum likelihood; Soft syndrome decoding; sorting

Indexed keywords

MATHEMATICAL TECHNIQUES - ERROR ANALYSIS; STATISTICAL METHODS;

ERROR PATTERNS; SOFT DECODING;

CODES, SYMBOLIC;

EID: 0026187202     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.86973     Document Type: Article

References (24)

1. R. A. Silverman and M. Balser, “Coding for a constant data rate source,” IRE Trans. Inform. Theory, vol. PG IT-4, pp. 50–63, Jan. 1954.
2. 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, no. 1, pp. 41–50, Jan. 1986.
3. Y. Be'ery and J. Snyders, “Optimal soft decision block decoders based on fast Hadamard transform,” IEEE Trans. Inform. Theory, vol. IT-32, no. 3, pp. 355–364, May 1986.
4. G. D. Forney, Jr., “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, no. 5, pt. II, pp. 1152–1187, Sept. 1988.
5. G. R. Lang and F. M. Longstaff, “A Leech lattice modem,” IEEE J. Select. Areas in Commun., vol. 7, pp. 968–973, Aug. 1989.
6. A. D. Abbaszadeh and C. K. Rushforth, “Efficient maximum likelihood decoding of the extended Nordstrom-Robinson code,” in Proc. 25th Ann. Allerton Conf., 1987, pp. 598–599.
7. A. R. Calderbank, “Multilevel codes and multistage decoding,” IEEE Trans. Commun., vol. 37, pp. 222–229, Mar. 1989.
8. Y. Be'ery, B. Shahar, and J. Snyders, “Fast decoding of the Leech lattice,” IEEE J. Select. Areas Commun., vol. 7, pp. 595–967, Aug. 1989.
9. 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, no. 5, pp. 963–975, Sept. 1989.
10. E. R. Berlekamp, “The technology of error-correcting codes,” Proc. IEEE, vol. 68, pp. 574–593, May 1980.
11. ——, “The construction of fast, high-rate, soft decision block decoders,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 372–377, May 1983.
12. J. K. Wolf, “Efficient maximum likelihood decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, Jan. 1978.
13. H. F. Mattson, Jr., “Another upper bound on covering radius,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 356–358, May 1983.
14. D. E. Knuth, The Art of Computer Programming. Reading, MA: Addison Wesley, 1973, vol. 3, pp. 181–242.
15. J. L. Massey, “Foundation and methods of channel encoding,” Proc. Int. Conf. Inform. Theory Syst. Berlin: NTG-Fachbrichte, vol. 65, Sept. 1978.
16. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
17. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam: North-Holland, 1977.
18. G. D. Forney, Jr., “A bounded distance decoding algorithm for the Leech lattice, with generalizations,” IEEE Trans. Inform. Theory, vol. 35, no. 4, pp. 906–909, July 1989.
19. S. Aran, “Efficient soft decision decoding of Reed-Muller codes and related non-linear generalizations,” M.Sc. thesis, Tel-Aviv Univ., Tel-Aviv, Israel, Oct. 1989.
20. J. Snyders and Y. Be'ery, “An approach to maximum likelihood decoding of q-ary block codes,” in Proc. Conf. Inform. Sci. Syst., Baltimore, MD, 1989, pp. 206–208.
21. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: The MIT Press, 1966, pp. 61–62.
22. D. Chase, “A class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, vol. IT-18, no. 2, pp. 170–182, Mar. 1972.
23. G. J. Pottie and D. P. Taylor, “Multilevel codes based on partitioning,” IEEE Trans. Inform. Theory, vol. 35, no. 1, pp. 87–98, Jan. 1989.
24. A. Vardy, J. Snyders, and Y. Be'ery, “Bounds on the dimension of codes and subcodes with prescribed contraction index,” in Linear Algebra and its Applicat., vol. 142, pp. 237–261, Dec. 1990.