Mathematical analysis of algebraic sequential coding (Q1204659)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mathematical analysis of algebraic sequential coding |
scientific article; zbMATH DE number 130723
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mathematical analysis of algebraic sequential coding |
scientific article; zbMATH DE number 130723 |
Statements
Mathematical analysis of algebraic sequential coding (English)
0 references
18 March 1993
0 references
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.
0 references
algebraic sequential decoding of convolutional codes
0 references
complexity
0 references
