Low weight subtrellises for binary linear block codes and their applications

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 11, 1997, Pages 2095-2102

  Kasami, Tadao ^a   Koumoto, Takuya ^b   Fujiwara, Toru ^c   Yamamoto, Hiroshi ^d   Desaki, Yoshihisa ^a   Lin, Shu ^b  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c TOKYO METROPOLITAN UNIVERSITY   (Japan)

^d University of Hawaii at Manoa   (United States)

Author keywords

Binary linear code; Low weight; Recursive decoding algorithm; Subtrellis diagram; Subtrellis search

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; COMPUTATIONAL COMPLEXITY; DECODING; INFORMATION THEORY; MATHEMATICAL MODELS; TRELLIS CODES;

BOSE CHAUDHURI HOCQUENGHAM (BCH) CODES; REED MULLER CODES;

ENCODING (SYMBOLS);

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

References (12)

1. H.T. Moorthy, S. Lin, and T. Kasami, Soft-decision decoding of binary linear block codes based on an iterative search algorithm, IEEE Trans. Inf. Theory, vol.43, no.3, pp. 1030-1040, May 1997.
2. T. Koumoto, H. Nagano, T. Takata, T. Fujiwara, T. Kasami, and S. Lin, A new iterative soft-decision decoding algorithm, IEICE Technical Report, IT95-28, July 1995, and Proc. 18th Symp. on Information Theory and Its Applications, pp.557-560, Oct. 1995.
3. T. Koumoto, T. Takata, T. Kasami, and S. Lin, An iterative soft-decision decoding algorithm, Proc. International Symposium on Information Theory and Its Applications, Victoria, Canada, pp.806-810, Sept. 1996.
4. G.D. Forney Jr., Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inf. Theory, vol.40, no.6, pp.1741-1752, Nov. 1994.
5. T. Sugita, T. Kasami, and T. Fujiwara, A method for computing split weight distributions of Reed-Muller codes, Proc. International Symposium on Information Theory and Its Applications, Victoria, Canada, pp.598-601, Sept. 1996.
6. F.J. MacWillams and N.J.A. Sloane, The theory of error-correcting codes, Amsterdam, The Netherlands: North-Holland, 1977.
7. min, Proc. of AAECC 12 Toulouse, France, pp.195-211, June 1997.
8. T. Kasami, H. Tokushige, T. Fujiwara, H. Yamamoto, and S. Lin, A recursive maximum likelihood decoding algorithm for Reed-Muller codes and related codes, Technical Report of NAIST, no.NAIST-IS-97003, Jan. 1997.
9. Y. Desaki, T. Fujiwara, and T. Kasami, A method for computing the weight distribution of a block code by using its trellis diagram, IEICE Trans. Fundamentals, vol.E77-A, no.8, pp.1230-1237, Aug. 1994.
10. T. Fujiwara, H. Yamamoto, T. Kasami, and S. Lin, A trellis-based recursive maximum likelihood decoding algorithm for linear block codes, Proc. 33rd Annual Allerton Conference on Communication, Control and Computing, pp.700-709, Oct. 1995, also to appear in IEEE Trans. Information Theory, 1998.
11. H. Yamamoto, H. Nagano, T. Fujiwara, T. Kasami, and S. Lin, Recursive MLD algorithm using the detail trellis structure for a linear block codes and its average complexity analysis, Proc. International Symposium on Information Theory and Its Applications, Victoria, Canada, pp.704-708, Sept. 1996.
12. A. Vardy and Y. Be'ery, Maximum likelihood-soft-decision decoding of BCH codes, IEEE Trans. Inf. Theory, vol.40, pp.546-554, March 1994.