Lower Bounds on Trellis Complexity of Block Codes

IEEE Transactions on Information Theory

Volumn 41, Issue 6, 1995, Pages 1938-1954

  Lafourcade, Alec ^a   Vardy, Alexander ^a  

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

Author keywords

block codes; dynamics of codes; generalized Hamming weight hierarchy; maximum likelihood decoding; Trellis complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; HIERARCHICAL SYSTEMS; TRELLIS CODES;

GENERALIZED HAMMING WEIGHT HIERARCHY; MAXIMUM LIKELIHOOD DECODING; TRELLIS COMPLEXITY;

BLOCK CODES;

EID: 0029409022     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.476318     Document Type: Article

References (43)

1. 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.
2. A. M. Barg and I. I. Dumer, “Concatenated decoding algorithms with partial enumeration of code vectors,” Probl. Peredachi Inform., vol. 22, pp. 3–10, 1986 (in Russian).
3. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
4. D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. New York: Academic Press, 1982.
5. 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, 1993.
6. G. Cohen, S. Litsyn, and G. Zémor, “Upper bounds on generalized distances,” IEEE Trans. Inform. Theory, vol. 40, pp. 2090–2092, 1994.
7. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
8. S. Dolinar, L. Ekroot, A. B. Kiely, R. J. McEliece, and W. Lin, “The permutation trellis complexity of linear block codes,” in Proc. 32nd Allerton Conf. on Communications, Control, and Computing (Monticello, IL., Sept. 1994), pp. 60–74.
9. G. D. Forney, Jr., “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–278, 1973.
10. —, “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, 1988.
11. —, “Dimension/length profiles and trellis complexity of linear block codes,” IEEE Trans. Inform. Theory, vol. 40, pp. 1741–1752, 1994.
12. —, “Density/length profiles and trellis complexity of lattices,” IEEE Trans. Inform. Theory, vol. 40, pp. 1752–1772, 1994.
13. 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.
14. T. Fujiwara, T. Kasami, R. Morelos-Zaragoza, and S. Lin, “The state complexity of trellis diagrams for a class of generalized concatenated codes,” preprint.
15. V. D. Goppa, “Bounds for codes,” Dokl. Akad. Nauk, vol. 333, p. 423, 1993 (in Russian).
16. T. Helleseth, T. Kløve, and J. Mykkelveit, “The weight distribution of irreducible cyclic codes,” Discr. Math., vol. 18, pp. 179–211, 1977.
17. T. Helleseth, T. Kløve, and Ø. Ytrehus, “Generalized Hamming weights of linear codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 1133–1140, 1992.
18. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, “On complexity of trellis structure of linear block codes,” presented at the IEEE Int. Symp. Inform. Theory, Budapest, Hungary, 1991.
19. —, “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.
20. A. B. Kiely, S. Dolinar, R. J. McEliece, L. Ekroot, and W. Lin, “Trellis decoding complexity of linear block codes,” IEEE Trans. Inform. Theory, submitted for publication.
21. F. R. Kschischang and G. B. Horn, “A heuristic for ordering a linear block code to minimize trellis state complexity,” in Proc. 32nd Allerton Conf. on Communication, Control, and Computing (Monticello, IL., Sept. 1994), pp. 75–84.
22. F. R. Kschischang and V. Sorokine, “On the trellis structure of block codes,” this issue, pp. 1924–1937.
23. B. D. Kudryashov and T.G. Zakharova, “Block codes from convolutional codes,” Probl. Peredachi Inform., vol. 25, pp. 98–102, 1989 (in Russian).
24. A. Lafourcade and A. Vardy, “On trellis complexity of good codes,” in Proc. 28th Annual Conf. on Information Sciences and Systems (Princeton, NJ, Mar. 1994).
25. —, “Asymptotically good codes have infinite trellis complexity,” IEEE Trans. Inform. Theory, vol. 41, pp. 555–559, 1995.
26. H. H. Ma and J. K. Wolf, “On tail biting convolutional codes,” IEEE Trans. Commun., vol. COM-34, pp. 104–111, 1986.
27. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
28. J. L. Massey, “Foundation and methods of channel encoding,” in Proc. Int. Conf. on Information Theory and Systems, NTG-Fachberichte, Berlin, 1978.
29. R. J. McEliece, “The Viterbi decoding complexity of linear block codes,” presented at the IEEE Int. Symp. Inform. Theory, Trondheim, Norway, 1994.
30. —, “On the BCJR trellis for linear block codes,” IEEE Trans. Inform. Theory, submitted for publication.
31. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, and L. R. Welch, “New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 157–166, 1977.
32. D. J. Muder, “Minimal trellises for block codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1049–1053, 1988.
33. J. B. Shearer, personal communication, 1994.
34. V. Tarokh and I. F. Blake, “Decoding complexity versus coding gain of lattices,” IEEE Trans. Inform. Theory, submitted for publication.
35. A. Vardy, “Dynamical structure of block codes,” presented at the IEEE Int. Workshop on Coding, System Theory, and Symbolic Dynamics, Mansfield, MA, Oct. 1993.
36. —, “The Nordstrom-Robinson code: Representation over GF(4) and efficient decoding,” IEEE Trans. Inform. Theory, vol. 40, pp. 1686–1693, 1994.
37. A. Vardy and Y. Be'ery, “Maximum-likelihood soft decision decoding of BCH codes,” IEEE Trans. Inform. Theory, vol. 40, pp. 546–554, 1994.
38. V. K. Wei, “Generalized Hamming weights for linear codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1412–1418, 1991.
39. —, “A survey of results on generalized Hamming weights for linear codes,” presented at the IEEE Inform. Theory Workshop, Sunoso, Japan, 1993.
40. 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.
41. Ø. Ytrehus, “On the trellis complexity of certain binary linear block codes,” IEEE Trans. Inform. Theory, vol. 41, pp. 559–560, 1995.
42. 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).
43. I. I. Dumer, “On complexity of maximum likelihood decoding of the best concatenated codes,” in Proc. 8th All-Union Conf. on Coding Theory and Information Theory (Moscow-Kuibushev, 1981), pp. 66–69 (in Russian).