On the root computation of polynomials over a finite field using a stored table approach

A method is proposed to compute the roots of a polynomial with degree four or less over a finite field. This method requires less computations and memory requirements than other methods, and it can achieve high-speed root computation. The proposed method for the root computation of a polynomial can be very useful to the high-speed BCH and Reed-Solomon decoding operations.