Computing roots of polynomials over function fields of curves
From MaRDI portal
Recommendations
- Polynomial root finding over local rings and application to error correcting codes
- Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
- A Root-Finding Algorithm for List Decoding of Reed–Muller Codes
- Root lifting techniques and applications to list decoding
Cited in
(19)- Horner versus Holdred: An episode in the history of root computation
- Computation of Minkowski values of polynomials over complex sets
- Numerical root finding via Cox rings
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- Polynomial root finding over local rings and application to error correcting codes
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
- Algorithms for modular counting of roots of multivariate polynomials
- Algorithms for Modular Counting of Roots of Multivariate Polynomials
- A Root-Finding Algorithm for List Decoding of Reed–Muller Codes
- Fast computation of the roots of polynomials over the ring of power series
- Root lifting techniques and applications to list decoding
- Absolute irreducibility of polynomials via Newton polytopes
- On \(\operatorname{Ext}^1\) for Drinfeld modules
- Construction-D lattice from Garcia–Stichtenoth tower code
- Factoring polynomials over function fields
- Improved computation of polynomial roots over number fields when using complex embeddings
- List decoding of Hermitian codes using Gröbner bases
- Power error locating pairs
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
This page was built for publication: Computing roots of polynomials over function fields of curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495303)