Computer Science – Information Theory
Scientific paper
2012-01-21
Computer Science
Information Theory
5 pages, submitted to the 2012 IEEE International Symposium on Information Theory
Scientific paper
In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction of tailbiting backward error-trellises. Moreover, we obtain the scalar parity-check matrix for a tailbiting convolutional code. The proposed construction is based on the adjoint-obvious realization of a syndrome former and its behavior is fully used in the discussion.
Okino Koji
Tajima Masato
No associations
LandOfFree
Error-Trellis Construction for Tailbiting Convolutional 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 Error-Trellis Construction for Tailbiting Convolutional Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error-Trellis Construction for Tailbiting Convolutional Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-134658