Finding roots of polynomials over finite fields
arXiv:cs/0606035 · doi:10.1109/TCOMM.2002.805269
Abstract
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
6 pages. IEEE Transactions on Communications