From Local to Robust Testing via Agreement Testing

Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi

Research output: Contribution to journalArticlepeer-review


A local tester for an error-correcting code is a probabilistic procedure that queries a small (sublinear) subset of coordinates, accepts codewords with probability one, and rejects non-codewords with probability proportional to their distance from the code. The local tester is said to be robust if for non-codewords it satisfies the stronger condition that the average distance of local views from accepting views is proportional to the distance from the code. Robust testing is an important component in constructions of locally testable codes and probabilistically checkable proofs as it allows for composition of local tests. We show that for certain codes, any (natural) local tester can be converted to a robust tester with roughly the same number of queries. Our result holds for the class of affine-invariant lifted codes which is a broad class of codes that includes Reed–Muller codes, as well as recent constructions of high-rate locally testable codes (Guo, Kopparty, and Sudan, ITCS 2013). Instantiating this with known local testing results for lifted codes gives a more.

Original languageEnglish
Article number12
JournalTheory of Computing
StatePublished - 2022

Bibliographical note

Publisher Copyright:
© 2022 Irit Dinur, Prahladh Harsha, Tali Kaufman, and Noga Ron-Zewi b Licensed under a Creative Commons Attribution License (CC-BY).


  • affine-invariant codes
  • agreement testing
  • lifted codes
  • local testing
  • robust soundness

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'From Local to Robust Testing via Agreement Testing'. Together they form a unique fingerprint.

Cite this