Generalized threshold decoding and the Reed- Solomon codes
Willis C. Gore · IEEE Transactions on Information Theory · 1969
A necessary condition for the existence of a set ofJorthogonal parity check equations is developed, and it is demonstrated that, except for the trivial codes, the Reed-Solomon codes are notL-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.