论文信息 - A bcjr-like labeling algorithm for tail-biting trellises

A bcjr-like labeling algorithm for tail-biting trellises

WE describe two constructions for tail-biting trellises that are very similar to the well known BCJR construction for conventional trellises. The constructions lead to a simple proof of the fact that there exist linear tail-biting trellises for a linear code and its dual, which have the same state-complexity profiles.

Aditya V. Nori | Priti Shankar

[1] Alexander Vardy,et al. On the Theory of Linear Trellises , 2002 .

[2] Alexander Vardy,et al. The structure of tail-biting trellises: minimality and basic principl , 2002, IEEE Trans. Inf. Theory.

[3] Frank R. Kschischang. The trellis structure of maximal fixed-cost codes , 1996, IEEE Trans. Inf. Theory.