The art of trellis decoding is computationally hard - For large fields

IEEE Transactions on Information Theory

Volumn 44, Issue 3, 1998, Pages 1211-1214

  Jain, Kamal ^a   Mǎndoiu, Ion ^a   Vazirani, Vijay V ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

MDS codes; NP hardness; Trellis complexity; Vandermonde matrices

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; MATRIX ALGEBRA; NUMERICAL METHODS;

COORDINATE PERMUTATION; TRELLIS COMPLEXITY; VANDERMONDE MATRICES;

TRELLIS CODES;

EID: 0032075310     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.669287     Document Type: Article

References (13)

1. J. Feigenbaum, G. D. Forney, Jr., B. Marcus, R. J. McEliece, and A. Vardy, Eds., IEEE Trans. Inform. Theory (Special issue on Codes and Complexity), vol. 42, pp. 1649-2057, Nov. 1996.
2. G. D. Forney, "Coset codes - Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
3. G. D. Forney and M. Trott, "The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders," IEEE Trans. Inform. Theory, vol. 39, pp. 1491-1513, 1993.
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
5. G. B. Horn and F. R. Kschischang, "On the intractability of permuting a block code to minimize trellis complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 2042-2048, 1996.
6. F. R. Kschischang and V. Sorokine, "On the trellis structure of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1924-1937, 1995.
7. J. L. Massey, "Foundation and methods of channel encoding," in Proc. Int. Conf. Information Theory and Systems, vol. 65. Berlin, Germany: NTG-Fachberichte, 1978.
8. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, 1996.
9. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
10. V. Shoup, "New algorithms for finding irreducible polynomials over finite fields," Math. Comp., vol. 54, pp. 435-447, 1990.
11. A. Vardy, "Algorithmic complexity in coding theory and the minimum distance problem," in Proc. 29th ACM Symp. Theory of Computing, 1997, pp. 92-109.
12. _, "The intractability of computing the minimum distance of a code," IEEE Trans. Inform. Theory, vol. 43, pp. 1757-1766, 1997.
13. V. V. Vazirani, H. Saran, and B. S. Rajan, "An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups," IEEE Trans. Inform. Theory, vol. 42, pp. 1839-1854, 1996.