Tail-Biting Trellises for Linear Codes and their Duals
Aditya Nori and Priti Shankar

IISc-CSA-TR-2003-4
(October 2003)

Available formats: [ps] [ps.gz]

Filed on June 21, 2004
Updated on June 25, 2004


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.


Please bookmark this technical report as http://aditya.csa.iisc.ernet.in/TR/2003/4/.

Problems ? Contact techrep@csa.iisc.ernet.in
[Updated at 2009-10-22T06:42Z]