Local irreducibility of tail-biting trellises

Heide Gluesing-Luerssen, G. David Forney

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trellis properties that amount to observability and controllability of trellis fragments of various lengths. For fragments of length less than the minimum span length of the code it is shown that fragment observability and fragment controllability are equivalent to irreducibility. For reducible trellises, a constructive reduction procedure is presented. The considerations also lead to a characterization for when the dual of a trellis allows a product factorization into elementary ('atomic') trellises.

Original languageEnglish
Article number6527994
Pages (from-to)6597-6610
Number of pages14
JournalIEEE Transactions on Information Theory
Issue number10
StatePublished - 2013


  • Codes on graphs
  • duality
  • minimality
  • trellis fragments

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Local irreducibility of tail-biting trellises'. Together they form a unique fingerprint.

Cite this