Finding roots of polynomials over finite fields

Simple item page
dc.creatorFedorenko, Sergei V.
dc.creatorTrifonov, Piter V.
dc.date2006-06-08
dc.date.accessioned2026-07-07T08:18:00Z
dc.date.available2026-07-07T08:18:00Z
dc.descriptionWe 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.
dc.description6 pages. IEEE Transactions on Communications
dc.identifierhttps://arxiv.org/abs/cs/0606035
dc.identifierhttp://arxiv.org/abs/cs/0606035
dc.identifierIEEE Transactions on Communications, Volume 50, Issue 11, Nov. 2002, Pages:1709 - 1711
dc.identifierdoi:10.1109/TCOMM.2002.805269
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134285
dc.subjectInformation Theory
dc.titleFinding roots of polynomials over finite fields
dc.typetext

Files

Collections

arXiv