Title :
Finding roots of polynomials over finite fields
Author :
Fedorenko, Sergei V. ; Trifonov, Peter V.
Author_Institution :
Dept. of Distributed Comput. & Networking, St. Petersburg State Polytech. Univ., Russia
fDate :
11/1/2002 12:00:00 AM
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.
Keywords :
BCH codes; Reed-Solomon codes; decoding; error correction codes; polynomials; BCH code; Bose-Chaudhuri-Hocquenghem code; Galois fields; Reed-Solomon code; affine polynomial; decoding speedup; error-correcting codes; finite fields; improved algorithm; polynomials roots; root-finding algorithm; Communications Society; Costs; Decoding; Distributed computing; Electronic mail; Error correction codes; Galois fields; Polynomials; Reflective binary codes; Search methods;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2002.805269
