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.
Published in:
Information Theory, IEEE Transactions on
(Volume:15
,
Issue:
3
)
Date of Publication:
May 1969
- Page(s):
-
414
-
418
- ISSN :
-
0018-9448
- Digital Object Identifier :
-
10.1109/TIT.1969.1054316
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 January 2003
- Issue Date :
-
May 1969
- Sponsored by :
-
IEEE Information Theory Society