Threshold decoding of cyclic codes

It is shown that every cyclic code over GF(p) can be decoded up to its minimum distance by a threshold decoder employing general parity checks and a single threshold element. This result is obtained through the application of a general decomposition theorem for complex-valued functions defined on the space of all n -tuples with elements from the ring of integers modulo p .