Hong, JonathanVetterli, Martin2005-04-182005-04-182005-04-18199510.1109/26.403765https://infoscience.epfl.ch/handle/20.500.14299/212820Proposes some simple algorithms for decoding BCH codes. The authors show that the pruned FFT is an effective method for evaluating syndromes and for finding the roots of error-locator polynomials. They show that a simple variation of the basic Gaussian elimination procedure can be adapted to compute the error-locator polynomial efficiently for codes with small designed distance. Finally, they give a procedure for computing the error values that has half the complexity of the Forney algorithm.text::journal::journal article::research article