Embedding Constructions of Tail-Biting Trellises for Linear Block Codes

Details Embedding Constructions of Tail-Biting Trellises for Linear Block Codes Embedding Constructions of Tail-Biting Trellises for Linear Block Codes

2011-09-06

arxiv.org/abs/1109.1105v1

Computer Science

Information Theory

Scientific paper

In this paper, embedding construction of tail-biting trellises for linear block codes is presented. With the new approach of constructing tail-biting trellises, most of the study of tail-biting trellises can be converted into the study of conventional trellises. It is proved that any minimal tail-biting trellis can be constructed by the recursive process of embedding constructions from the well-known Bahl-Cocke-Jelinek-Raviv (BCJR) constructed conventional trellises. Furthermore, several properties of embedding constructions of tail-biting trellises are discussed. Finally, we give four sufficient conditions to reduce the maximum state-complexity of a trellis with one peak.

Affiliated with

Also associated with

No associations

Rating

Embedding Constructions of Tail-Biting Trellises for Linear Block Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Embedding Constructions of Tail-Biting Trellises for Linear Block Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding Constructions of Tail-Biting Trellises for Linear Block Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-93063