Fast decoding reed solomon codes using properties of vandermonde matrices

Reed Solomon (RS) codes are one of the most practically used error recovery codes. This paper proposes a fast decoding algorithm for RS error recovery codes. The proposed method decomposes the matrix that arises in the recovery process. The matrix is decomposed into a Vandermonde matrix and a diagonal matrix. Then by using the properties of the Vandermonde matrices, the decoding is accelerated. It is also shown that the proposed algorithm has lower computational complexity compared to the other RS decoding algorithms.