Maximum-Likelihood Soft Decision Decoding of BCH Codes

IEEE Transactions on Information Theory

Volumn 40, Issue 2, 1994, Pages 546-554

  Vardy, Alexander ^a   Be’ery, Yair ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

BCH codes; maximum likelihood soft decision decoding; minimal trellises of block codes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECODING; ERROR CORRECTION; ESTIMATION; INFORMATION THEORY; MATHEMATICAL TRANSFORMATIONS;

BCH CODES; BINARY CODES; MAXIMUM LIKELIHOOD SOFT DECISION DECODING; MINIMAL TRELLIES OF BLOCK CODES; VITERBI DECODING;

CODES (SYMBOLS);

EID: 0028388409     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.312184     Document Type: Article

References (25)

1. S. Aran, “Efficient soft decision decoding of Reed-Muller codes and related non-linear generalizations,” M.Sc. thesis, Tel-Aviv Univ., 1989.
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. Y. Berger and Y. Be’ery, “Bounds on the trellis size of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-39, pp. 203-209, 1993.
4. Y. Berger and Y. Be’ery, “Soft trellis-based decoder for linear block codes,” IEEE Trans. Inform. Theory, 1994, to be published.
5. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
6. E. R. Berlekamp, “The construction of fast, high-rate, soft decision block decoders,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 372-377, 1983.
7. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
8. A. E. Brouwer and T. Verhoeff, “An updated table of minimum-distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-39, pp. 662-677, 1993.
9. G. D. Cohen, S. Litsyn, A. Vardy, and G. Zemor, “Perfect tilings of binary spaces,” preprint.
10. 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, pp. 41-50, 1986.
11. G. L. Feng, K. K. Tzeng, and V. K. Wei, “On the generalized Hamming weights of several classes of cyclic codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 1125-1130, 1992.
12. G. D. Forney, Jr., “Coset codes II: Binary lattices and related codes,” IEEE Trans.Inform. Theory, vol. 34, pp. 1152-1187, 1988.
13. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “Trellis diagram construction for some BCH codes,” in IEEE Int. Symp. Inform. Theory’ and Appl., Honolulu, HI, 1990.
14. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On complexity of trellis structure of linear block codes,” IEEE Int. Symp. Inform. Theory, Budapest, Hungary, 1991.
15. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On the optimum bit orders with respect to the state complexity of trellis d agrams for binary linear codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 242-243, 1993.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
17. D. J. Mader, “Minimal trellises for block codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
18. 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, 1989.
19. A. Vardy and Y. Be’ery, “On the problem of finding zero-concurring codewords,” IEEE Trans. Inform. Theory, vol. 37, pp. 180-187, 1991.
20. A. Vardy and Y. Be’ery, “Bit-level soft decision decoding of Reed-Solomon codes,” IEEE Trans. Commun., vol. 39, pp. 440-445, 1991.
21. A. Vardy and Y. Be’ery, “More efficient soft-decision decoding of the Golay codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 667-672, 1991.
22. A. Vardy, J. Snyders, and Y. Be’ery, “Bounds on the dimension of codes and subcodes with prescribed contraction index,” Linear Algebra Appl., vol. 142, pp. 237-261, 1990.
23. T. Verhoeff, “An updated table of minimum-distance bounds for binary linear codes.” IEEE Trans. Inform. Theory, vol. IT-33, pp. 665-680, 1987.
24. V. K. Wei, “Generalized Hamming weights for linear codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, 1991.
25. J. K. Wolf, “Efficient maximum-likelihood decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, 1978.