An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
Information Theory
2024-07-26 v2 math.IT
Abstract
The most famous error-decoding algorithm for convolutional codes is the Viterbi algorithm. In this paper, we present a new reduced complexity version of this algorithm which can be applied to a class of binary convolutional codes with optimum column distances called k-partial simplex convolutional codes.
Cite
@article{arxiv.2402.01279,
title = {An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes},
author = {Zita Abreu and Julia Lieb and Michael Schaller},
journal= {arXiv preprint arXiv:2402.01279},
year = {2024}
}
Comments
accepted for ISIT 2024