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.
展开▼
