Asymptotically Good Codes Have Infinite Trellis Complexity

IEEE Transactions on Information Theory

Volumn 41, Issue 2, 1995, Pages 555-559

  Lafourcade, Alec ^a   Vardy, Alexander ^a  

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

Author keywords

asymptotically good codes; dynamics of block codes; maximum likelihood decoding; Trellis complexity

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECODING; INFORMATION THEORY; MATHEMATICAL MODELS; TRELLIS CODES;

ALPHABETS; ASYMPTOTICALLY GOOD CODES; BLOCK CODE DYNAMICS; INFINITE SEQUENCE; LOGARITHMS; MINIMAL TRELLIS REALIZATION; TRELLIS COMPLEXITY;

BLOCK CODES;

EID: 0029276653     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.370171     Document Type: Article

References (22)

1. N. Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth, “Construction of asymptotically good low-rate error-correcting codes through pseudorandom graphs,” IEEE Trans. Inform. Theory, vol. 38, pp. 509–516, 1992.
2. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 284–287, 1974.
3. G. D. Forney, Jr., “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, 1988.
4. —, “Dimension/length profiles and trellis complexity of linear block codes,” IEEE Trans. Inform. Theory, vol. 40, pp. 1741–1752, 1994.
5. —, “Density/length profiles and trellis complexity of lattices,” IEEE Trans. Inform. Theory, vol. 40, pp. 1753–1772, 1974.
6. —, personal communication.
7. G. D. Forney, Jr., and M. D. Trott, “The dynamics of group codes: state spaces, trellis diagrams and canonical encoders,” IEEE Trans. Inform. Theory, vol. 39, pp. 1491–1513, 1993.
8. J. Justesen, “A class of constructive asymptotically good algebraic codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 652–656, 1972.
9. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 242–243, 1993.
10. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On structural complexity of the L-section minimal trellis diagrams for binary linear block codes,” IEICE Trans., vol. E76-A, pp. 1411–1421. 1993.
11. F. R. Kschischang and V. Sorokine, “On the trellis structure of block codes,” IEEE Trans. Inform. Theory, to appear.
12. S. Lin and E. J. Weldon, “Long BCH codes are bad” Inform. Contr., vol. 11, pp. 445–451, 1967.
13. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holl and, 1977.
14. J. L. Massey, “Foundation and methods of channel encoding,” in Proc. Int. Conf. Information Theory and Systems, NTG-Fachberichte (Berlin, Germany, 1978), vol. 65, pp. 148–157.
15. R. J. McEliece, “The Viterbi decoding complexity of linear block codes,” in Proc. IEEE Int. Symp. Information Theory (Trondheim, Norway, 1994), p. 341.
16. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, and L. R. Welch, “New upper bounds on the rate of a code via the Dclsarte-MacWilliams inequalities,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 157–166, 1977.
17. D. J. Muder, “Minimal trellises for block codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1049–1053, 1988.
18. A. Vardy, “Dynamical structure of block codes,” presented at the IEEE Int. Workshop on Coding, System Theory, and Symbolic Dynamics, Mansfield, MA, Oct. 1993.
19. A. Vardy and Y. Be'ery, “Maximum-likelihood soft decision decoding of BCH codes,” IEEE Trans. Inform. Theory, vol. 40, pp. 546–554, 1994.
20. J. K. Wolf, “Efficient maximum-likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, 1978.
21. Ø. Ytrehus, “On the trellis complexity of certain binary linear block codes,” this issue, pp. 000–000.
22. V. V. Zyablov and V. R. Sidorenko, “Bounds on complexity of trellis decoding of linear block codes,” Probl. Peredachi Inform., vol. 29, pp. 3–9, 1993 (in Russian).