Some decomposable codes: The | + x|b + x|a + b + x| construction

IEEE Transactions on Information Theory

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

  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; Decomposable codes; Multistage decoding; Trellis codes

Indexed keywords

ALGORITHMS; BLOCK CODES; CODING ERRORS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; TRELLIS CODES;

DECOMPOSABLE CODES; MULTISTAGE DECODING;

DECODING;

EID: 0031233253     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623171     Document Type: Article

References (19)

1. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
2. H. Imai and S. Hirakawa, "A new multilevel coding method using error-correcting codes," IEEE Trans. Inform. Theory, vol. IT-23, pp. 371-377, May 1977.
3. G. D. Forney, Jr., "Coset codes II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
4. A. R. Calderbank, "Multilevel codes and multistage decoding," IEEE Trans. Commun., vol. 37, pp. 222-229, Mar. 1989.
5. F. Hemmati, "Closest coset decoding of |u|u+v| codes," IEEE J. Select. Areas Commun., vol. 7, pp. 982-988, Aug. 1989.
6. J. Wu, S. Lin, T. Kasami, T. Takata, and T. Fujiwara, "An upper bound on the effective error coefficient of two-stage decoding and good two-level decompositions of some Reed-Muller codes," IEEE Trans. Commun., vol. 42, pp. 813-818, Feb.-Apr. 1994.
7. T. Takata, Y. Yamashita, T. Fujiwara, T. Kasami, and S. Lin, "Suboptimum decoding of decomposable block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1392-1405, Sept. 1994.
8. G. Schnabl and M. Bossert, "Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes," IEEE Trans. Inform. Theory, vol. 41, pp. 304-308, Jan. 1995.
9. F. W. Sun and H. C. A. van Tilborg, "The Leech lattice, the octa-code, decoding algorithms," IEEE Trans. Inform. Theory, vol. 41, pp. 1097-1106, July 1995.
10. N. J. A. Sloane, S. M. Reddy, and C.-L. Chen, "New binary codes," IEEE Trans. Inform. Theory, vol. IT-18, pp. 503-510, July 1972.
11. V. V. Rao and S. M. Reddy, "A (48,31,8) linear code," IEEE Trans. Inform. Theory, vol. IT-19, pp. 709-711, Sept. 1973.
12. W. Feit, "A self-dual even (96,48,16) code," IEEE Trans. Inform. Theory, vol. IT-20, pp. 136-138, Jan. 1974.
13. M. P. C. Fossorier and S. Lin, "Computationally efficient soft decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 42, pp. 738-750, May 1996.
14. A. E. Brouwer and T. Verhoeff, "An updated table of minimum-distance bounds for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, Mar. 1993.
15. S. Lin and D. J. Costello, Jr., Error Control Coding Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
16. A. Lafourcade and A. Vardy, "Lower bounds on trellis complexity of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1938-1954, Nov. 1995.
17. 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;
18. submitted to IEEE Trans. Inform. Theory, June 1996.
19. H. T. Moorthy, S. Lin, and G. T. Uehara, "Good trellises for IC implementation of viterbi decoders for linear block codes," IEEE Trans. Commun., vol. 45, pp. 52-63, Jan. 1997.