Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes

Yaron Shany, Yair Be'Ery

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

This study considered linear tail-biting trellises for block codes. Some structural properties of linear tail-biting trellises were proven by introducing the notions of subtrellis, merging interval, and sub-tail-biting trellis. Further, a necessary condition required from a linear code to have a linear tail-biting trellis representation that achieves the square-root bound was derived.

Original languageEnglish
Pages (from-to)1514-1523
Number of pages10
JournalIEEE Transactions on Information Theory
Volume46
Issue number4
DOIs
StatePublished - Jul 2000

Fingerprint

Dive into the research topics of 'Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes'. Together they form a unique fingerprint.

Cite this