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.

翻译：卷积码最著名的纠错译码算法是维特比算法。本文提出一种新的低复杂度改进算法，该算法适用于一类具有最优列距离的二元卷积码——k部分单形卷积码。