Abstract
It is shown how the decoding algorithms of Pellikaan and Rosenthal can be coupled to produce a decoding algorithm for convolutional codes. Bounds for the computational cost per decoded codeword are also computed. As a case study, our results are applied to a family of convolutional codes constructed by Rosenthal–Schumacher–York and, in this situation, the previous bounds turn out to be polynomial on the degree of the code.
Funder
Ministerio de Ciencia e Innovación
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference20 articles.
1. Fundamentals of Error-Correcting Codes;Huffman,2003
2. A new computational decoding complexity measure of convolutional codes
3. The trellis complexity of convolutional codes
4. Fundamentals of Convolutional Coding;Johannesson,1999
5. An Algebraic Decoding Algorithm for Convolutional Codes;Rosenthal,1999
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献