A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1987-1991

  Shen, Ba Zhong ^a   Tzeng, Kenneth K ^a,b   Wang, Chun ^a,c  

^a Lehigh University   (United States)

^b Quantum Corporation   (United States)

^c NOKIA RESEARCH CENTER   (United States)

Author keywords

Binary linear block codes; Bounded distance decoding; Decoding complexity; Effective error coefficient; Errors and erasures decoding; Generalized minimum distance decoding

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); ERROR CORRECTION; PROBABILITY; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; BINARY LINEAR BLOCK CODES; BOUNDED DISTANCE DECODING ALGORITHMS; ERROR COEFFICIENT; ERRORS AND ERASURES DECODING; MINIMUM DISTANCE DECODING;

DECODING;

EID: 0030287616     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556690     Document Type: Article

References (41)

1. J. K. Wolf, "Efficient maximum likelihood decoding of block codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, no. 1, pp. 76-80, Jan. 1978.
2. 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, 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 U: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 1152-1187, Sept. 1988.
5. 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.
6. A. Vardy and Y. Be'ery, "More efficient soft decoding of the Golay codes," IEEE Trans. Inform. Theory, vol. 37, no. 3, pp. 667-672, May 1991.
7. "Maximum-likelihood decoding of the Leech lattice," IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1435-1444, July 1993.
8. T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder," IEEE Trans. Inform. Theory, vol. 40, no. 2, pp. 320-327, Mar. 1994.
9. 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.
10. O. Amrani, Y. Be'ery, and A. Vardy, "Bounded-distance decoding of the Leech lattice and the Golay code," Lecture Notes in Computer Science, vol. 781. New York: Springer-Verlag, 1993, pp. 236-247.
11. O. Amrani, Y. Be'ery, A. Vardy, F.-W. Sun, and H. C. A. van Tilborg, "The Leech lattice and the Golay code: Bounded-distance decoding and multilevel constructions," IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 1030-1043, July 1994.
12. F.-W. Sun and H. C. A. van Tilborg, "Fast bounded-distance decoding of the Nordstrom-Robinson code," Communications and Cryptography, R. E. Blahut, D. J. Costello Jr., U. Maurer, and T. Mittelholzer, Eds. Boston, Dordrecht. London: Kluwer, 1994, pp. 391-398.
13. O. Amrani and Y. Be'ery, "Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code," Proc. 1994 IEEE Int. Symp. on Information Theory (Tröndheim, Norway, June 1994), p. 400.
14. F.-W Sun and H. C. A. van Tilborg, "More efficient bounded-distance decoding of the Golay code and the Leech lattice," Proc. 1994 IEEE Int. Symp. on Information Theory (Tröndheim, Norway, June 1994), p. 399.
15. "The Leech lattice, the octacode, and decoding algorithms," IEEE Trans. Inform. Theory, vol. 41, no. 4, pp. 1079-1106, July 1995.
16. A. Vardy, "Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice," IEEE Trans. Inform. Theory, vol. 41, no. 5, pp. 1495-1499, Sept. 1995.
17. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: M.I.T. Press, 1966.
18. "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, Apr. 1966.
19. G. Einarsson and C. E. Sundberg, "A note on soft decision decoding with successive erasures," IEEE Trans. Inform. Theory, vol. IT-22, no. 1, pp. 88-96, Jan. 1976.
20. C. C. Yu and D. J. Costello Jr., "Generalized minimum distance decoding algorithms for Q-ary output channels," IEEE Trans. Inform. Theory, vol. IT-26, no. 2, pp. 238-243, Mar. 1980.
21. D. J. Taipale and M. B. Pursley, "An improvement to generalizedminimum-distance decoding," IEEE Trans. Inform. Theory, vol. 37, no. 1, pp. 167-172, Jan. 1991.
22. C. Wang, B.-Z. Shen, and K. K. Tzeng, "Generalized minimum distance decoding of Reed-Muller codes and Barnes-Wall lattices," Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 186.
23. G. D. Forney, Jr., '"On decoding BCH codes," IEEE Trans. Inform. Theory, vol. IT-11, pp. 549-557, Oct. 1965.
24. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, "An erasures-and-errors decoding algorithm for Goppa codes," IEEE Trans. Inform. Theory, vol. IT-22, no. 2, pp. 238-241, Mar. 1976.
25. P. Stevens, "Error-erasure decoding of binary cyclic codes up to a particular instance of the Haitmann-Tzeng bound," IEEE Trans. Inform. Theory, vol. 36, no. 5, pp. 1144-1149, Sept. 1990.
26. H. Shahri and K. K. Tzeng, "On error-and-erasure decoding of cyclic codes," IEEE Trans. Inform. Theory, vol. 38, no. 2, pp. 489-496, Mar. 1992.
27. H. Shahri, K. K. Tzeng, and G. L. Feng, "On evaluating errors and erasures in decoding of cyclic codes," in Proc. 1990 Int. Symp. on Information Theory and Its Applications (Waikiki, Hawaii, Nov. 1990), pp. 135-138.
28. H. Shahri, K. K. Tzeng, ar.d J. C. M. Janssen, "On error-and-erasure decoding of cyclic codes up to the roos bound," Proc. 1991 IEEE Int. Symp. on Information Theory (Budapest, Hungary, June 1991), p. 92.
29. A. Skorobogatov and S. Vlädut, "On the decoding of algebraicgeometric codes," IEEE Trans. Inform. Theory, vol. 36, no. 5, pp. 1051-1060, Sept. 1990.
30. G.-L. Feng and T. R. N. Rao, "Erasures-and-errors decoding of algebraic-geometric codes," Proc. 1993 IEEE Information Theory Workshop (Shizuoka, Japan, June 1993), pp. 79-80.
31. B.-Z. Shen and K. K. Tz,eng, "A code decomposition approach for decoding cyclic and algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 41, no. 6, pp. 1969-1987, Nov. 1995.
32. "Error-and-erasure decoding of Golay codes via code decomposition," Proc. 32nd Annual Allerton Conf. on Communication, Control, and Computing (Monticello, IL, Sept. 1994), pp. 85-92.
33. H. Lee, K. K. Tzeng, and C. J. Chen, "Error-and-erasure decoding of binary cyclic codes up to actual minimum distance," Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 411.
34. S. Sakata, "Fast error-and-erasure decoding of any one-point AG codes up to Feng-Rao bound," Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 96.
35. L. R. Welch and E. R. Berlekamp, "Error correction for algebraic block codes," U.S. Patent 4633470, Dec. 30, 1986.
36. K. Araki, M. Takada, and M. Morii, "The generalized syndrome polynomial and its application to the efficient decoding of ReedSolomon codes based on the GMD criterion," Proc. 1993 IEEE Int. Symp. on Information Theory, (sSan Antonio, TX, Jan. 1993), p. 34.
37. U. K. Sorger, "A new Reed-Solomon code decoding algorithm based on Newton's interpolation," IEEE Trans. Inform. Theory, vol. 39, no. 2, pp. 358-365, Mar. 1993.
38. D. J. Taipale and M. J. Seo, "An efficient soft-decision Reed-Solomon decoding algorithm," IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 1130-1139, July 1994.
39. E. R. Berlekamp, "Bounded-distance +1 soft-decision Reed-Solomon decoding," IEEE Trans. Inform. Theory, vol. 42, no. 3, pp. 704-720, May 1996.
40. R. Kotier, "Fast generalized minimum-distance decoding of algebraicgeometry and Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 42, no. 3, pp. 721-737, May 1996.
41. G. D. Forney, Jr. and A. Vardy, "Generalized minimum distance decoding of Euclidean-space codes and lattices," this issue, pp. 1992-2026.