Trellis complexity versus the coding gain of lattices .2.
For an arbitrary rational lattice L with gain gamma, the average number of states (respectively, branches) in any given trellis diagram of L is bounded below by a function of gamma, It is proved that this function grows exponentially in gamma, In the reverse direction, it is proved that given epsilon > 0, for arbitrarily large values of gamma, there exist lattices of gain gamma with an average number of branches and states less than exp (gamma((1+epsilon))).
coding gain lattices trellis complexity of lattices maximum-likelihood decoding asymptotically good lattices trellis complexity of codes