An error/erasure decoding algorithm of (2m,2m−3) extended RS codes

An algorithm for correcting both an error and an erasure of (2^m,2^m-3) extended RS codes is proposed in this paper. Using the algorithm, error locations and error values can be found by skipping the procedures of determining error location polynomial, finding the roots and calculating the deviation of error location polynomial; therefore, the decoding algorithm is very simple and fast.