Polynomial root finding over local rings and application to error correcting codes
From MaRDI portal
Publication:2441447
DOI10.1007/s00200-013-0200-5zbMath1309.13034OpenAlexW2057464053MaRDI QIDQ2441447
Jérémy Berthomieu, Guillaume Quintin, Grégoire Lecerf
Publication date: 24 March 2014
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00642075v2/file/main36.pdf
Linear codes (general theory) (94B05) Polynomials, factorization in commutative rings (13P05) Decoding (94B35)
Related Items (10)
On algorithms to find \(p\)-ordering ⋮ On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ On the complexity exponent of polynomial system solving ⋮ An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Counting roots for polynomials modulo prime powers ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Unnamed Item ⋮ Randomized polynomial-time root counting in prime power rings ⋮ Accelerated tower arithmetic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Relaxed algorithms for \(p\)-adic numbers
- On expansion of algebraic functions in power and Puiseux series. I
- On expansion of algebraic functions in power and Puiseux series. II
- On fast multiplication of polynomials over arbitrary algebras
- On the complexity of rational Puiseux expansions
- Decoding of Reed Solomon codes beyond the error-correction bound
- Algebraic geometric codes over rings
- Polynomial evaluation and interpolation on special sets of points
- Fast separable factorization and applications
- Fast multiplication of large numbers
- The algebraic closure of the power series field in positive characteristic
- Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient
- Generalized Newton-Puiseux Theory and Hensel's Lemma in Cx, y
- Effective procedures in field theory
- A New Algorithm for Decoding Reed-Solomon Codes
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
- Algebraic soft-decision decoding of reed-solomon codes
- Hensel and Newton Methods in Valuation Rings
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
- Error Correction Coding
- Complexity of computation of embedded resolution of algebraic curves
- On the Structure and Ideal Theory of Complete Local Rings
- Computing local integral closures
This page was built for publication: Polynomial root finding over local rings and application to error correcting codes
