Bounds on 2-query Locally Testable Codes with affine tests
Information Processing Letters, pp. 521-525, 2016.
Locally Testable CodesUnique Games ConjectureComputational complexityTheory of computation
•We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an affine test.•We show that such LTCs, with high minimal distance, must be of constant size.•Our main motivation in studying such LTCs is the Unique Games Conjecture, and the close connection between LTCs and PCPs.
Full Text (Upload PDF)
PPT (Upload PPT)