For trellis diagrams of lattices, we derive a range of upper bounds on different complexity measures (state, edge, and label group complexities, and also the number of distinct paths). These constructive bounds which are in terms of dimension, and the successive minima or the determinant of the lattice, both outperform and generalize the similar results of [1].

Proceedings of the 1997 IEEE International Symposium on Information Theory
Department of Systems and Computer Engineering

Banihashemi, A, & Blake, Ian F. (Ian F.). (1997). New upper bounds on trellis complexity of lattices. In IEEE International Symposium on Information Theory - Proceedings.