TY - GEN
T1 - Tail-biting products trellises, the BCJR-construction and their duals
AU - Gluesing-Luerssen, Heide
AU - Weaver, Elizabeth
PY - 2010
Y1 - 2010
N2 - We consider the constructions of tail-biting trellises for linear codes introduced by Koetter/Vardy [6] and Nori/Shankar [12]. We will show that each one-to-one product trellis can be merged to a BCJR-trellis defined in a slightly stronger sense than in [12] and that each trellis that originates from the characteristic matrix defined in [6] is a BCJR-trellis. Furthermore, BCJR-trellises are always nonmergeable. Finally, we will consider a certain duality conjecture of Koetter/Vardy and show that it holds true for minimal trellises.
AB - We consider the constructions of tail-biting trellises for linear codes introduced by Koetter/Vardy [6] and Nori/Shankar [12]. We will show that each one-to-one product trellis can be merged to a BCJR-trellis defined in a slightly stronger sense than in [12] and that each trellis that originates from the characteristic matrix defined in [6] is a BCJR-trellis. Furthermore, BCJR-trellises are always nonmergeable. Finally, we will consider a certain duality conjecture of Koetter/Vardy and show that it holds true for minimal trellises.
UR - https://www.scopus.com/pages/publications/80051936280
UR - https://www.scopus.com/pages/publications/80051936280#tab=citedBy
U2 - 10.1109/CIG.2010.5592710
DO - 10.1109/CIG.2010.5592710
M3 - Conference contribution
AN - SCOPUS:80051936280
SN - 9781424482641
T3 - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
BT - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
T2 - 2010 IEEE Information Theory Workshop, ITW 2010
Y2 - 30 August 2010 through 3 September 2010
ER -