Error-correction Decoding for 2D Convolutional Codes with a Generalized Viterbi Algorithm
Abstract
Two-dimensional (2D) convolutional codes are a generalization of one-dimensional (1D) convolutional codes and are naturally suitable for encoding two-dimensional data. Although their theoretical properties are well established, practical applications are limited due to the lack of error-correction decoding algorithms. While the Viterbi algorithm provides an efficient decoding method for 1D convolutional codes, no analogous approach exists for the 2D case. In this paper, we introduce a decoding algorithm for 2D convolutional codes, called the 2D Viterbi algorithm, extending the principles of the classical Viterbi algorithm to the two-dimensional setting. The presented 2D Viterbi algorithm works with linear systems representations of 2D convolutional codes and its complexity depends on the dimension of the corresponding 2D linear system. Hence, we also provide several algorithms to obtain 2D realizations of small dimension.
Related
- Automated correction of training sets for biological image segmentation by convolutional networks
- A Generalized Ridge Regression and Convolutional LASSO
- Sparse Identification for Automatic Large-Scale Screening: A Constraint-Aware Framework with Ultra Fast Decoding Algorithm
- A Generalized Half-Singleton Bound for List Decoding of Insertion/Deletion Errors
- A complete classification for n-species Lotka-Volterra stably dissipative systems based on a generalized AHU algorithm
BibTeX
@misc{abreu2026errorcorrection,
title = {{Error-correction Decoding for 2D Convolutional Codes with a Generalized Viterbi Algorithm}},
author = {Zita Abreu and Elisa Junghans and Julia Lieb and Raquel Pinto},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.27978},
eprint = {2610.27978},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.27978},
note = {CC BY-SA 4.0},
}
RIS
TY - UNPB
TI - Error-correction Decoding for 2D Convolutional Codes with a Generalized Viterbi Algorithm
AU - Zita Abreu
AU - Elisa Junghans
AU - Julia Lieb
AU - Raquel Pinto
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.27978
UR - https://arxiv.org/abs/2610.27978
AB - Two-dimensional (2D) convolutional codes are a generalization of one-dimensional (1D) convolutional codes and are naturally suitable for encoding two-dimensional data. Although their theoretical properties are well established, practical applications are limited due to the lack of error-correction decoding algorithms. While the Viterbi algorithm provides an efficient decoding method for 1D convolutional codes, no analogous approach exists for the 2D case. In this paper, we introduce a decoding algorithm for 2D convolutional codes, called the 2D Viterbi algorithm, extending the principles of the classical Viterbi algorithm to the two-dimensional setting. The presented 2D Viterbi algorithm works with linear systems representations of 2D convolutional codes and its complexity depends on the dimension of the corresponding 2D linear system. Hence, we also provide several algorithms to obtain 2D realizations of small dimension.
ER -