On the trellis complexity of the densest lattice packings in ℝn

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 4, 1996, Pages 597-601

  Blake, Ian F ^a   Tarokh, Vahid ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Coding gain; Rational lattices; Trellis complexity

Indexed keywords

EID: 4243172578     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195283348     Document Type: Article

References (6)

1. J. H. CONWAY AND N. J. A. SLOANE, Sphere Packings, Lattices and Groups, Springer-Verlag, Berlin, New York, 1993.
2. G. D. FORNEY, Coset codes-part II: Binary lattices and related codes, IEEE Trans. Inform. Theory, 34 (1988), pp. 1152-1187.
3. _, Density/length profiles and trellis complexity of lattices, IEEE Trans. Inform. Theory, 40 (1995), pp. 1753-1772.
4. _, Private communication, 1995.
5. V. TAROKH, Trellis Complexity Versus The Coding Gain of Lattice-Based Communication Systems, Ph.D. thesis, The University of Waterloo, Waterloo, Ontario, Canada, 1995.
6. M. A. TSFASMAN AND S. G. VLADUT, Algebraic-Geometric Codes, Kluwer Academic Publishers, Norwell, MA, 1991.