2020/08/20 by Julia Lieb, Lieb, Julia, Joachim Rosenthal +1
Computer Science · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #Dynamical Systems (math.DS) #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #math.DS #math.IT
paper · pdf · doi:10.48550/arxiv.2008.09013
arxiv created 2020/08/20 · openalex publication_date 2020/08/20 · arxiv updated 2020/08/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we employ the linear systems representation of a convolutional code to develop a decoding algorithm for convolutional codes over the erasure channel. We study the decoding problem using the state space description and this provides in a natural way additional information. With respect to previously known decoding algorithms, our new algorithm has the advantage that it is able to reduce the decoding delay as well as the computational effort in the erasure recovery process. We describe which properties a convolutional code should have in order to obtain a good decoding performance and illustrate it with an example.