Finding roots of polynomials over finite fields
Sergei V. Fedorenko, Piter V. Trifonov
TL;DR
This paper introduces an improved algorithm for efficiently finding roots of polynomials over finite fields, significantly enhancing decoding speed for various error-correcting codes.
Contribution
The paper presents a novel algorithm that accelerates root-finding over finite fields, improving decoding efficiency for multiple error-correcting codes.
Findings
Speedup in decoding process of BCH and Reed-Solomon codes
Enhanced efficiency in polynomial root-finding over finite fields
Potential applications in error correction and data transmission
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.