2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/134285We 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.6 pages. IEEE Transactions on CommunicationsInformation Theorytext