Polynomial root finding over local rings and application to error correcting codes
Résumé
This article is devoted to algorithms for computing all the roots of a univariate polynomial with coefficients in a complete commutative Noetherian unramified regular local domain, which are given to a fixed common finite precision. We study the cost of our algorithms, discuss their practical performances, and apply our results to the Guruswami and Sudan list decoding algorithm over Galois rings.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...