2002/11/01 by Sergei V. Fedorenko, Peter Trifonov, Piter V. Trifonov · 1 citation
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #cs.IT #graph theory and CDMA systems #math.IT #semigroups and automata theory
paper · pdf · doi:10.1109/tcomm.2002.805269
published as IEEE Transactions on Communications, Volume 50, Issue 11, Nov. 2002, Pages:1709 - 1711 · 6 pages. IEEE Transactions on Communications
openalex publication_date 2002/11/01 · arxiv created 2006/06/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.