Work

A Decoding Algorithm for Convolutional Codes

Year: 2022

Type: article

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.

Source: Mathematics

DOI: 10.3390/math10091573

Authors: Sandra Martín Sánchez, Francisco J. Plaza Martín

Institution: Universidad de Salamanca

Language: English

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,885

Funder: Ministerio de Ciencia e Innovación