Abstract
This study considered linear tail-biting trellises for block codes. Some structural properties of linear tail-biting trellises were proven by introducing the notions of subtrellis, merging interval, and sub-tail-biting trellis. Further, a necessary condition required from a linear code to have a linear tail-biting trellis representation that achieves the square-root bound was derived.
Original language | English |
---|---|
Pages (from-to) | 1514-1523 |
Number of pages | 10 |
Journal | IEEE Transactions on Information Theory |
Volume | 46 |
Issue number | 4 |
DOIs | |
State | Published - Jul 2000 |