Noisy interpolating sets for low-degree polynomials

DOI10.4086/TOC.2011.V007A001MaRDI QIDQ3002826zbMATH OpenOpenAlexFDO

Authors Zeev Dvir, Amir Shpilka

Publication date 24 May 2011

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2011.v007a001

zbMATH Keywords

error-correcting codespolynomial interpolationReed-Muller codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Decoding Reed-Muller codes over product sets
• Decoding Reed-Muller codes over product sets
• Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
• Learning polynomials with queries: The highly noisy case
• Repairing Reed-solomon codes

Cited in

(4)

• Noisy interpolation of sparse polynomials in finite fields
• Small Sample Spaces Cannot Fool Low Degree Polynomials
• Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
• Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited

This page was built for publication: Noisy interpolating sets for low-degree polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002826)