Lower bounds on the state complexity of linear tail-biting trellises |
| |
Authors: | Shany Y Reuven I Be'ery Y |
| |
Affiliation: | Dept. of Electr. Eng.-Syst., Tel-Aviv Univ., Israel; |
| |
Abstract: | 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. |
| |
Keywords: | |
|
|