Tail-biting products trellises, the BCJR-construction and their duals

Heide Gluesing-Luerssen, Elizabeth Weaver

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
DOIs
StatePublished - 2010
Event2010 IEEE Information Theory Workshop, ITW 2010 - Dublin, Ireland
Duration: Aug 30 2010Sep 3 2010

Publication series

Name2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Conference

Conference2010 IEEE Information Theory Workshop, ITW 2010
Country/TerritoryIreland
CityDublin
Period8/30/109/3/10

ASJC Scopus subject areas

  • Information Systems
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Tail-biting products trellises, the BCJR-construction and their duals'. Together they form a unique fingerprint.

Cite this