Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Package for the Implementation of Block Codes as Finite Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
On Trellis Structures for Reed-Muller Codes
Finite Fields and Their Applications
Code constructions and existence bounds for relative generalized Hamming weight
Designs, Codes and Cryptography
| Hi-index | 754.84 |
It is shown that soft decision maximum likelihood decoding of any(n,k)linear block code overGF(q)can be accomplished using the Viterbi algorithm applied to a trellis with no more thanq^{(n-k)}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 thanq^{n-k}. For a binary(n,n - 1)single parity check code, the Viterbi algorithm is equivalent to the Wagner decoding algorithm.