DocumentCode :
911908
Title :
Generalized threshold decoding and the Reed- Solomon codes
Author :
Gore, Willis C.
Volume :
15
Issue :
1
fYear :
1969
fDate :
1/1/1969 12:00:00 AM
Firstpage :
78
Lastpage :
81
Abstract :
A necessary condition for the existence of a set of 
orthogonal parity check equations is developed, and it is demonstrated that, except for the trivial codes, the Reed-Solomon codes are not 
-step orthogonalizable. Massey\´s concept of threshold decoding is generalized, and it is demonstrated that the Reed-Solomon codes are completely threshold decodable. Since every BCH code is a subcode of some Reed-Solomon code, every BCH code has a generalized threshold decoder.
orthogonal parity check equations is developed, and it is demonstrated that, except for the trivial codes, the Reed-Solomon codes are not -step orthogonalizable. Massey\´s concept of threshold decoding is generalized, and it is demonstrated that the Reed-Solomon codes are completely threshold decodable. Since every BCH code is a subcode of some Reed-Solomon code, every BCH code has a generalized threshold decoder.Keywords :
Reed-Solomon codes; Threshold decoding; Circuit noise; Decoding; Equations; Error correction codes; Linear code; Parity check codes; Reed-Solomon codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1969.1054269
Filename :
1054269
Link To Document :
