Error-Trellis Construction for Tailbiting Convolutional Codes
Information Theory
2012-01-24 v1 math.IT
Abstract
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.
Cite
@article{arxiv.1201.4428,
title = {Error-Trellis Construction for Tailbiting Convolutional Codes},
author = {Masato Tajima and Koji Okino},
journal= {arXiv preprint arXiv:1201.4428},
year = {2012}
}
Comments
5 pages, submitted to the 2012 IEEE International Symposium on Information Theory