Linear tail-biting trellises: Characteristic generators and the BCJR-construction

Details Linear tail-biting trellises: Characteristic generators and the BCJR-construction Linear tail-biting trellises: Characteristic generators and the BCJR-construction

2010-03-23

arxiv.org/abs/1003.4539v1

updated version in IEEE Trans. Inf. Theory, 2011, vol. 57, 738-751

Computer Science

Information Theory

28 pages

Scientific paper

We investigate the constructions of tail-biting trellises for linear block codes introduced by Koetter/Vardy (2003) and Nori/Shankar (2006). For a given code we will define the sets of characteristic generators more generally than by Koetter/Vardy and we will investigate how the choice of characteristic generators affects the set of resulting product trellises, called KV-trellises. Furthermore, we will show that each KV-trellis is a BCJR-trellis, defined in a slightly stronger sense than by Nori/Shankar, and that the latter are always non-mergeable. Finally, we will address a duality conjecture of Koetter/Vardy by making use of a dualization technique of BCJR-trellises and prove the conjecture for minimal trellises.

Affiliated with

Also associated with

No associations

Rating

Linear tail-biting trellises: Characteristic generators and the BCJR-construction 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 Linear tail-biting trellises: Characteristic generators and the BCJR-construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear tail-biting trellises: Characteristic generators and the BCJR-construction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56461