We propose a fast decoding algorithm for the p-ary first-order Reed-Muller code guaranteeing correction of up to [n/4sin(p-1/2pπ)] errors and having complexity proportional to nlogn, where n=pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case.
