Bounds on 2-query Locally Testable Codes with affine tests.

Information Processing Letters（2016）

引用 7|浏览76

暂无评分

摘要

•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.

查看译文

关键词

Locally Testable Codes,Unique Games Conjecture,Computational complexity,Theory of computation

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要