Finding roots of polynomials over finite fields
<|reference_start|>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.<|reference_end|>
@article{fedorenko2006finding,
    title={Finding roots of polynomials over finite fields},
    author={Sergei V. Fedorenko, Piter V. Trifonov},
    journal={IEEE Transactions on Communications, Volume 50, Issue 11, Nov.
  2002, Pages:1709 - 1711},
    year={2006},
    doi={10.1109/TCOMM.2002.805269},
    archivePrefix={arXiv},
    eprint={cs/0606035},
    primaryClass={cs.IT math.IT}
}