Finding roots of polynomials over finite fields

Finding roots of polynomials over finite fields

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 2002-11, Vol.50 (11), p.1709-1711
Hauptverfasser: Fedorenko, S.V., Trifonov, P.V.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Communications Society
Costs
Decoding
Distributed computing
Electronic mail
Error correction
Error correction codes
Galois fields
Mathematical analysis
Polynomials
Reflective binary codes
Roots
Search methods
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2002.805269