Answers are grounded in this paper and cite their sources.
It is shown that soft decision maximum likelihood decoding of any <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(n,k)</tex> linear block code over <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">GF(q)</tex> can be accomplished using the Viterbi algorithm applied to a trellis with no more than <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q⁽ⁿ⁻ᵏ⁾</tex> states. For cyclic codes, the trellis is periodic. When this technique is applied to the decoding of product codes, the number of states in the trellis can be much fewer than <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">qⁿ⁻ᵏ</tex> . For a binary <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(n,n - 1)</tex> single parity check code, the Viterbi algorithm is equivalent to the Wagner decoding algorithm.
No takes yet. Share an insight, caveat, or question.
J.K. Wolf (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: