Fast error magnitude evaluations for Reed-Solomon codes
John Joseph Komo, L.L. Joiner · 2002
A fast algorithm for the evaluation of error magnitudes for Reed-Solomon codes is obtained here in terms of the error locations and syndromes. This fast algorithm is compared to the Forney algorithm (1965) in terms of required additions and multiplications and implementation speed.