@inproceedings{nori2003tail-biting,
author = {Nori, Aditya and Shankar, Priti},
title = {Tail-Biting Trellises for Linear Codes and their Duals},
booktitle = {Proceedings of the Forty-First Annual Allerton Conference on Communication, Control and Computing (Allerton)},
year = {2003},
month = {October},
abstract = {The 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, the Massey [3] and the BCJR [1] 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, satisfying the property that the two trellises have identical state-complexity profiles.},
url = {http://approjects.co.za/?big=en-us/research/publication/tail-biting-trellises-for-linear-codes-and-their-duals/},
edition = {Proceedings of the Forty-First Annual Allerton Conference on Communication, Control and Computing (Allerton)},
}