Fast Error Magnitude Evaluations for Reed-Solomon Codes

摘要

A fast algorithm for the evaluation of error magnitudes for Reed-Solomon codes isobtained here in terms of the error locations and syndromes. This fast algorithm is compared to the Forney algorithm in terms of required additions and multiplications and implementation speed.