DocumentCode :
912413
Title :
Threshold decoding of cyclic codes
Author :
Rudolph, Luther D.
Volume :
15
Issue :
3
fYear :
1969
fDate :
5/1/1969 12:00:00 AM
Firstpage :
414
Lastpage :
418
Abstract :
It is shown that every cyclic code over 
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 
-tuples with elements from the ring of integers modulo 
.
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 -tuples with elements from the ring of integers modulo .Keywords :
Cyclic codes; Threshold decoding; Decoding; Information science; Logic; Matrix decomposition; Parity check codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1969.1054316
Filename :
1054316
Link To Document :
