A sufficient condition for ruling out some useless test error patterns in iterative decoding algorithms

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 2, 1998, Pages 321-326

  Koumotq, Takuya ^a,b   Kasami, Tadao ^a   Lin, Shu ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b University of Hawaii at Manoa   (United States)

Author keywords

Binary linear code; Chase algorithm; Iterative decoding; Optimality test; Sufficient condition

Indexed keywords

ALGORITHMS; BINARY CODES; CORRELATION METHODS; ITERATIVE METHODS; VECTORS;

BINARY LINEAR CODES; CHASE ALGORITHMS; ITERATIVE DECODING ALGORITHMS; TEST ERROR PATTERNS;

DECODING;

EID: 0031998350     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. D. Chase, "A new class for decoding block codes with channel measurement information," IEEE Trans. Information Theory, vol. IT-18, pp. 170-182, Jan. 1972.
2. T. Kaneko, T. Nishijima, and S. Hirasawa, "Efficient maximum-likelihood-decoding using bounded distance decoding," Technical Report oflEICE, IT94-34, The Inst. of Electronics, Information and Communication Engineers, Japan, July 1994.
3. S. Lin, H. T. Moorthy, and T. Kasami, "An efficient softdecision decoding scheme for binary linear block codes," Proc. of the 3rd International Symposium on Communication Theory & Applications, pp. 4-11, July 1995, Charlotte Mason College, Ambleside, Lake District, UK.
4. H. T. Moorthy, S. Lin, and T. Kasami, "Soft-decision decoding of binary linear block codes based on an iterative search algorithm," IEEE Trans. Information Theory, voI. IT-43, ppJ030-1040, May 1997.
5. M. Kobayashi, A. Ogino, T. Kohnosu, and S. Hirasawa, "On reducing complexity of soft-decision decoding," Proc. of the 17th Symp. on Information Theory and Its Applications, pp. 333-336, Dec. 1994.
6. T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder," IEEE Trans. Information Theory, vol. IT-40, pp. 320-327, March 1994.
7. D. J. Taipale and M. B. Pursley, "An improvement to generalized minimum-distance decoding," IEEE Trans. Information Theory, voI. IT-37, pp. 167-172, Jan. 1991.
8. T. Kasami, T. Koumoto, T. Takata, and S. Lin, "The effectiveness of the least stringent sufficient condition on the optimality of decoded codewords," Proc. of the 3rd International Symposium on Communication Theory & Applications, pp. 324-333, July 1995, Charlotte Mason College, Ambleside, Lake District, UK.
9. T. Koumoto, T. Takata, T. Kasami, and S. Lin, "Condition for reducing the number of iterations of iterative decoding," Technical Report of IEICE, IT95-73, March 1996.