Arrow Research search
Back to STOC

STOC 2021

Decoding multivariate multiplicity codes on product sets

Conference Paper Session 9A Algorithms and Complexity ยท Theoretical Computer Science

Abstract

The multiplicity Schwartz-Zippel lemma bounds the total multiplicity of zeroes of a multivariate polynomial on a product set. This lemma motivates the multiplicity codes of Kopparty, Saraf and Yekhanin [J. ACM, 2014], who showed how to use this lemma to construct high-rate locally-decodable codes. However, the algorithmic results about these codes crucially rely on the fact that the polynomials are evaluated on a vector space and not an arbitrary product set.

Authors

Keywords

  • Schwartz-Zippel lemma
  • list decoding
  • multiplicity codes

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
121052158212017157
v2026.09.13