Publication | Open Access
Finding roots of polynomials over finite fields
62
Citations
2
References
2002
Year
Finite FieldsImproved AlgorithmEngineeringComputational Number TheoryFinite FieldAlgebraic MethodOther Error-correcting CodesComputational ComplexityComputer ScienceApplied AlgebraCoding TheoryApproximation Theory
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1