| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Polynomial root finding over local rings and application to error correcting codes
Abstract : 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.
Cited literature [45 references]
https://hal.inria.fr/hal-00642075
Contributor : Guillaume Quintin <>
Submitted on : Friday, December 20, 2013 - 5:27:58 PM
Last modification on : Friday, January 8, 2021 - 5:42:02 PM
Long-term archiving on: : Friday, March 21, 2014 - 9:26:04 AM
Contributor : Guillaume Quintin <>
Submitted on : Friday, December 20, 2013 - 5:27:58 PM
Last modification on : Friday, January 8, 2021 - 5:42:02 PM
Long-term archiving on: : Friday, March 21, 2014 - 9:26:04 AM
File
main36.pdf
Publisher files allowed on an open archive