Mathematical analysis of algebraic sequential coding
In this paper the author treats the mathematical analysis of algebraic sequential decoding of convolutional codes. He shows that if \(q>2\) this method for a convolutional code over \(GF(q)\) gives some proceedings in the complexity of decoding as compared to classical sequential decoding and decoding of Viterbi. The probability theoretic theorems show well the benefit of the used decoding algorithm.
algebraic sequential decoding of convolutional codes
scientific article; zbMATH DE number 130723