Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder
Arne Dür · IEEE Transactions on Information Theory · 1993
BCH decoders based on the Peterson-Gorenstein-Zierler algorithm can malfunction and produce output vectors that are no codewords. To avoid this malfunction a simple additional check is proposed that can be performed before the computation of the error locations. The additional check consists of the minimum number of algebraic equations in the syndrome components that are necessary over a general field to obtain a bounded-distance decoder.>