Tail-biting Trellises for Linear Codes and their Duals
Aditya Nori, Priti Shankar · 2003
Construction of dual tail-biting trellises from primal ones is an important problem in trellis based decoding algorithms for linear codes. Generalizations of two well known labeling algorithms are presented for the construction of tail-biting trellises. The construction techniques lead directly to an algorithm for construction of a dual trellis from an algebraic description of the primal one. 1