Linear Tail-Biting Trellis and Its Sectionalization

In this paper, we discuss the sectionalization in linear tail-biting trellis. In [3], Lafourcade and Vardy investigated the basic property of sectionalization in conventional trellis. Their proofs of basic properties are based on conventional trellis structure which fails to be generalized to linear tail-biting trellis. We derive our proofs from the construction of Koetter-Vardy(KV) trellis in [1]. All properties of sectionalization in conventional trellis are preserved in linear tail-biting trellis. Especially, we prove the necessary condition of an optimal sectionalization in linear tail-biting trellis.

[1]  G. David Forney,et al.  Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.

[2]  A. Robert Calderbank,et al.  Minimal tail-biting trellises: The Golay code and more , 1999, IEEE Trans. Inf. Theory.

[3]  Frank R. Kschischang,et al.  On the trellis structure of block codes , 1994, IEEE Trans. Inf. Theory.

[4]  Robert J. McEliece,et al.  On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.

[5]  R. Koetter,et al.  The structure of tail-biting trellises: minimality and basic principles , 2002, Proceedings IEEE International Symposium on Information Theory,.

[6]  A. Nori Unifying Views Of Tail-Biting Trellises For Linear Block Codes , 2005 .

[7]  Alexander Vardy,et al.  Optimal sectionalization of a trellis , 1996, IEEE Trans. Inf. Theory.