Finding roots of polynomials over finite fields
Information Theory
2007-07-16 v1 math.IT
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.
Cite
@article{arxiv.cs/0606035,
title = {Finding roots of polynomials over finite fields},
author = {Sergei V. Fedorenko and Piter V. Trifonov},
journal= {arXiv preprint arXiv:cs/0606035},
year = {2007}
}
Comments
6 pages. IEEE Transactions on Communications