A unified method for evaluating the error-correction radius of reliability-based soft-decision algorithms for linear block codes

IEEE Transactions on Information Theory

Volumn 44, Issue 2, 1998, Pages 691-700

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

^a IEEE   (United States)

^b University of Hawaii at Manoa   (United States)

Author keywords

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

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; ERROR CORRECTION; OPTIMIZATION;

LINEAR CODES; MAXIMUM LIKELIHOOD DECODING; SOFT DECISION DECODING ALGORITHMS;

DECODING;

EID: 0032023862     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661513     Document Type: Article

References (24)

1. 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, pp. 963-975, Sept. 1989.
2. N. J. C. Lous, P. A. H. Bours, and H. C. A. van Tilborg, "On maximum likelihood soft-decision decoding of binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 197-203, Jan. 1993.
3. J. Snyders, "Reduced lists of error patterns for maximum likelihood soft decoding," IEEE Trans. Inform. Theory, vol. 37, pp. 1194-1200, July 1991.
4. 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.
5. 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.
6. D. Gazelle and J. Snyders, "Reliability-based code-search algorithm for maximum-likelihood decoding of block codes," IEEE Trans. Inform. Theory, vol. 43, pp. 239-249, Jan. 1997.
7. G. D. Forney, Jr., "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, Apr. 1966.
8. 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.
9. H. Tanaka and K. Kakigahara, "Simplified correlation decoding by selecting codewords using erasure information," IEEE Trans. Inform. Theory, vol. IT-29, pp. 743-748, Sept. 1983.
10. 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.
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. Y. S. Han, C. R. P. Hartmann, and K. G. Mehrotra, "Further results on decoding linear block codes using a generalized Dijkstra's algorithm," in the Proc. IEEE Int. Symp. Information Theory (Trondheim, Norway, June 1994), p. 342.
13. 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, also "Correction," vol. 42, p. 328, Jan. 1996.
14. _, "Computationally efficient soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 42, pp. 738-750, May 1996.
15. 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.
16. M. P. C. Fossorier, S. Lin, and J. Snyders, "Reliability-based syndrome decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 44, pp. 388-398, Jan. 1998.
17. B. Z. Shen, K. K. Tzeng, and C. Wang, "A bounded distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient," IEEE Trans. Inform. Theory, vol. 42, pp. 1987-1991, Nov. 1996.
18. G. D. Forney, Jr. and A. Vardy, "Generalized minimum-distance decod-ing of Euclidean-space codes and lattices," IEEE Trans. Inform. Theory, vol. 42, pp. 1992-2026, Nov. 1996.
19. M. P. C. Fossorier and S. Lin, "Complementary reliability-based decodings of binary linear block codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1667-1672, Sept. 1997.
20. H. G. Eggleston, Convexity, Cambridge, U.K.: Cambridge Univ. Press, 1963.
21. L. R. Foulds, Optimization Techniques, an Introduction. New York: Springer-Verlag, 1981.
22. 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.
23. C. M. Hackett, "An efficient algorithm for soft decision decoding of the (24, 12) extended Golay code," IEEE Trans. Commun., vol. COM-29, pp. 909-911, June 1981.
24. V. K. Wei, "Generalized Hamming weights for linear codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, Sept. 1991.