2012/01/21 by Masato Tajima, Tajima, Masato, Koji Okino +1 · 3 citations
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithm #Artificial intelligence #Block code #Coding theory and cryptography #Computer science #Concatenated error correction code #Convolutional code #Decoding methods #Error Correcting Code Techniques #Error detection and correction #FOS: Computer and information sciences #Information Theory (cs.IT) #Mathematics #Realization (probability) #Space–time trellis code #Statistics #Trellis (graph) #Trellis quantization #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1201.4428
published in arXiv (Cornell University) 111(454), 85-90 (Cornell University) · 5 pages, submitted to the 2012 IEEE International Symposium on Information Theory
arxiv created 2012/01/21 · openalex publication_date 2012/01/21 · arxiv updated 2012/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.