Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
Yaron Shany, I. Reuven, Yair Be'ery · IEEE Transactions on Information Theory · 2004
Lower bounds on the state complexity of linear tail-biting trellises are presented. One bound generalizes the total-span bound, while another bound can be regarded as a generalization of the cut-set bound. It is shown by examples that the new bounds may be tighter than any of the existing lower bounds.