Title :
Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder
Author_Institution :
Inst. fuer Math., Innsbruck Univ., Austria
fDate :
3/1/1993 12:00:00 AM
Abstract :
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
Keywords :
BCH codes; Reed-Solomon codes; decoding; error correction codes; BCH codes; Peterson-Gorenstein-Zierler algorithm; Reed-Solomon codes; bounded-distance decoder; decoder malfunction; error correction; syndrome components; Algorithm design and analysis; Decoding; Equations; Error correction; Hamming distance; Linear code; Polynomials; Reed-Solomon codes; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
