2000 character limit reached
An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes (2402.01279v2)
Published 2 Feb 2024 in cs.IT and 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.