A bcjr-like labeling algorithm for tail-biting trellises
Aditya Nori, Priti Shankar · 2003
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.