Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values

DOI10.1145/2442829.2442852zbMath1323.65008OpenAlexW2133040107MaRDI QIDQ5244527

Erich L. Kaltofen, Matthew T. Comer, Clément Pernet

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442852

zbMATH Keywords

fault tolerancepolynomial recoverylinearly generated sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05)

Related Items (4)

A fast parallel sparse polynomial GCD algorithm ⋮ Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? ⋮ On error correction with errors in both the channel and syndrome ⋮ Accurate solution of near-colliding Prony systems via decimation and homotopy continuation

This page was built for publication: Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values