On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $
Ian F. Blake, Vahid Tarokh · SIAM Journal on Discrete Mathematics · 1996
An inequality relating the trellis complexity of lattices to their dimension 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 $\mathbb{R}^n $ grows exponentially as a function of their coding gain.