A minimum distance decoding algorithm for non-binary first order Reed-Muller codes is described. Suggested decoding is based on a generalization of the fast Hadamard transform to the non-binary case. We also propose a fast decoding algorithm for non-binary first order Reed-Muller codes with complexity proportional to the length of the code. This algorithm provides decoding within the limits guaranteed by the minimum distance of the code.
|Number of pages||10|
|Journal||Applicable Algebra in Engineering, Communications and Computing|
|State||Published - 1996|
- Fast decoding algorithms
- Reed-Muller codes