ON THE TRELLIS COMPLEXITY OF THE DENSEST LATTICE PACKINGS IN R(N)

Authors
BLAKE IF TAROKH V
Citation
If. Blake et V. Tarokh, ON THE TRELLIS COMPLEXITY OF THE DENSEST LATTICE PACKINGS IN R(N), SIAM journal on discrete mathematics, 9(4), 1996, pp. 597-601
Citations number
5
Categorie Soggetti
Mathematics,Mathematics
Journal title
SIAM journal on discrete mathematics → ACNP
ISSN journal
08954801
Volume
9
Issue
4
Year of publication
1996
Pages
597 - 601
Database
ISI
SICI code
0895-4801(1996)9:4<597:OTTCOT>2.0.ZU;2-J
Abstract
An inequality relating the trellis complexity of lattices to their dim ension and Hermite parameter is established. Using this inequality, a conjecture of Forney is proved indicating that the trellis complexity of the densest lattice packings in R(n) grows exponentially as a funct ion of their coding gain.