A Decoding Algorithm for Convolutional Codes

Sandra Martín Sánchez and Francisco J. Plaza Martín
Additional contact information
Sandra Martín Sánchez: Departamento de Matemáticas, Universidad de Salamanca, Plaza de la Merced 1, 37008 Salamanca, Spain
Francisco J. Plaza Martín: Departamento de Matemáticas, Universidad de Salamanca, Plaza de la Merced 1, 37008 Salamanca, Spain

Mathematics, 2022, vol. 10, issue 9, 1-13

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.

Keywords: convolutional code; decoding algorithm; complexity (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/9/1573/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/9/1573/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:9:p:1573-:d:810012

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().