Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
DOI10.1145/2608628.2608660zbMath1325.68288arXiv1403.3594OpenAlexW3102074344MaRDI QIDQ3452405
Erich L. Kaltofen, Clément Pernet
Publication date: 11 November 2015
Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3594
sparse polynomial interpolationProny's algorithmBlahut's algorithmexact polynomial fitting with errors
Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Decoding (94B35)
Related Items (1)
Uses Software
Cites Work
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decomposition using validated numerics
- The Jordan Curve Theorem, Formally and Informally
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Definability and decision problems in arithmetic
- Unnamed Item
- Unnamed Item
This page was built for publication: Sparse polynomial interpolation codes and their decoding beyond half the minimum distance