It is shown that every cyclic code overGF(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 alln-tuples with elements from the ring of integers modulop.
No takes yet. Share an insight, caveat, or question.
L. Rudolph (1969) studied this question.