Finding roots of polynomials over finite fields

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
6 pages. IEEE Transactions on Communications

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134285

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0606035
 http://arxiv.org/abs/cs/0606035
 IEEE Transactions on Communications, Volume 50, Issue 11, Nov. 2002, Pages:1709 - 1711
 doi:10.1109/TCOMM.2002.805269

Collections

arXiv