Trellis complexity versus the coding gain of lattices II

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1808-1816

  Tarokh, Vahid ^a,b   Blake, Lan F ^c,d  

^a IEEE

^b UNIVERSITY OF WATERLOO   (Canada)

^c University of Illinois at Urbana Champaign   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Asymptotically good lattices; Coding gain; Lattices; Maximum likelihood decoding; Trellis complexity of codes; Trellis complexity of lattices

Indexed keywords

ALGORITHMS; BLOCK CODES; CONVOLUTIONAL CODES; DECODING; DIFFERENTIAL EQUATIONS; ENCODING (SYMBOLS); MATHEMATICAL MODELS; SET THEORY; TRELLIS CODES;

ARBITRARY RATIONAL LATTICE; CODING GAIN; MAXIMUM LIKELIHOOD DECODING; TRELLIS COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0030290136     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556676     Document Type: Article

References (26)

1. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rates, 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. Pered. Inform., vol. 22, pp. 3-10, 1986. (English translation)
3. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1993.
4. M. V. Eyuboglu and G. D. Forney, Lattices and trellis quantization with lattice and trellis-bounded code-books, IEEE Trans. Inform. Theory, vol. 39, pp. 46-59, 1993.
5. G. D. Forney,"Coset codes-Part II: Binary lattices and related codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
6. Trellises old and new, in Communications and Cryptography: Two Sides of One Tapestry, R. E. Blahut et al, Eds. Dordrecht, The Netherlands: Kluwer, 1994.
7. Density/length profiles and trellis complexity of lattices, IEEE Trans. Inform.Theory, vol. 40, pp. 1753-1772, 1995.
8. Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, 1995.
9. private communication.
10. G. D. Forney and M. D. Trott, The dynamics of group codes: state spaces, trellis diag rams, and canonical encoders, IEEE Trans. Inform. Theory, vol. 39, pp. 1491-1513, 1993.
11. P.M. Gruber and G.G. Lekkerkerker, Geometry of Numbers, 2nd ed. New York: Elsevier, 1987.
12. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.
13. 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.
14. F. R. Kschichang and V. Sorokine, On the trellis structure of block codes, IEEE Trans. Inform. Theory, vol. 41, pp. 1924-1937, Nov. 1995.
15. B. D. Kudryashov and T. G. Zakharova, Block codes from convolutional codes, Probl. Pered. Inform., vol. 25, pp. 98-102, 1989 (English translation).
16. A. Lafourcade and A. Vardy, Asymptotically good codes have infinite trellis complexity, IEEE Trans. Inform. Theory, vol. 41, pp. 555-559, Mar. 1995.
17. H. A. Loeliger, On existence proofs for asymptotically good Euclidean space group codes, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 14, pp. 15-18, 1993.
18. H. H. Ma and J. K. Wolf, On tail biting conventional codes, IEEE Trans. Commun, vol. COM-34, pp. 104-111, 1986.
19. J. L. Massey, Foundation and methods of channel encoding, in Proc. Int. Conf. on Information Theory and Systems (Berlin, Germay, NTG-Fachberichte, 1978).
20. D. J. Muder, Minimal trellises for block codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
21. J. R. Munkres, Topology, A First Course. Englewood Cliffs, NJ: Prentice-Hall, 1975.
22. V. Tarokh, Trellis complexity versus the coding gain of lattice-based communication systems, Ph.D. dissertation, Univ.of Waterloo, Waterloo, Ont., Canada, 1995.
23. V. Tarokh and I. F. Blake, Trellis decoding complexity versus the coding gain of lattices I, this issue, pp. 1796-1807.
24. P. van Emde Boas, Another Ni-1-complete problem and the complexity of computing short vectors in a lattice, Rep. 81-04, Math. Inst. Univ Amsterdam, The Netherlands.
25. J. K. Wolf, Efficient maximum-likelihood decoding of linear block codes, IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, 1978.
26. K. Sh. Zigangirov, New asymptotic lower bounds on the free distance for time constant convolutional codes, Probl. Pered. Inform., vol. 22, pp. 34-42, 1986 (English translation).