A coset construction is presented for tail-biting trellises

which for a given linear block code C computes a

non-mergeable linear trellis representing C. This construction

is analogous to the Forney construction for

minimal conventional trellises. Unlike the case of conventional

trellises where the Forney construction and

the Kschischang-Sorokine (KS) product construction

give isomorphic trellises, the generalization of the Forney

construction presented here and the Koetter-Vardy

adaptation of the KS construction do not give isomorphic

trellises in general.

PDF file

In: Proceedings of the International Symposium on Information Theory and its Applications (ISITA)

Details