Complementary reliability-based decodings of binary linear block codes

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1667-1672

  Fossorier, Marc P C ^a,b   Lin, Shu ^a,b  

^a IEEE   (United States)

^b University of Hawaii at Manoa   (United States)

Author keywords

Block codes; Maximum likelihood decoding; Ordered statistics; Reliability information; Soft decision decoding

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; BOOLEAN ALGEBRA; CODING ERRORS; COMPUTATIONAL COMPLEXITY; RELIABILITY THEORY;

CODING GAIN; MAXIMUM LIKELIHOOD DECODING METHOD; SOFT DECISION DECODING METHOD;

DECODING;

EID: 0031238038     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623172     Document Type: Article

References (15)

1. T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum likelihood decoding of linear block codes with algebraic decoder," IEEE Trans. Inform. Theory, vol. 40, pp. 320-327, Mar. 1994.
2. H. T. Moorthy, S. Lin, and T. Kasami, "Soft-decision decoding of binary linear block codes based on an iterative search algorithm," IEEE Trans. Inform. Theory, vol. 43, pp. 1030-1040, May 1997.
3. Y. S. Han, C. R. P. Hartmann, and C. C. Chen, "Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1514-1523, Sept. 1993.
4. M. P. C. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 41, pp. 1379-1396, Sept. 1995.
5. D. Gazelle and J. Snyders, "Reliability-based code-search algorithms for maximum-likelihood decoding of block codes," IEEE Trans. Inform. Theory, vol. 43, pp. 239-249, Jan. 1997.
6. D. Chase, "A class of algorithms for decoding block codes with channel measurement information," IEEE Trans. Inform. Theory, vol. IT-18, pp. 170-182, Jan. 1972.
7. N. N. Tendolkar and C. R. P. Hartmann, "Generalization of Chase algorithms for soft decision decoding of binary linear codes," IEEE Trans. Inform. Theory, vol. IT-30, pp. 714-721, Sept. 1984.
8. M. P. C. Fossorier and S. Lin, "First-order approximation of the ordered binary-symmetric channel," IEEE Trans. Inform. Theory, vol. 42, pp. 1381-1387, Sept. 1996.
9. M. P. C. Fossorier, S. Lin, and D. Rhee. "Bit error probability for maximum likelihood decoding of linear block codes," in Proc. Int. Symp. on Information Theory and Its Applications (Victoria, Canada, Sept. 1996), pp. 606-609;
10. submitted to IEEE Trans. Inform. Theory, June 1996.
11. D. J. Taipale and M. B. Pursley, "An improvement to generalized-minimum-distance decoding," IEEE Trans. Inform. Theory, vol. 37, pp. 167-172, Jan. 1991.
12. T. Kasami, T. Koumoto, T. Takata, T. Fujiwara, and S. Lin, "The least stringent sufficient condition on the optimality of suboptimally decoded codewords," in Proc. IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 470;
13. submitted to IEEE Trans. Inform. Theory, June 1996.
14. S. B. Wicker, Error Control Coding Systems for Digital Communication and Storage. Englewood Cliffs, NJ: Prentice-Hall, 1995.
15. F. W. Sun and H. C. A. van Tilborg, "The leech lattice, the octacode, and decoding algorithms," IEEE Trans. Inform. Theory, vol. 41, pp. 1097-1106, July 1995.