Affiliation:
1. Weizmann Institute of Science, Rehovot, Israel
2. Massachusetts Institute of Technology, Cambridge, MA
Abstract
We initiate a systematic study of locally testable codes; that is, error-correcting codes that admit very efficient membership tests. Specifically, these are codes accompanied with tests that make a constant number of (random) queries into any given word and reject non-codewords with probability proportional to their distance from the code.Locally testable codes are believed to be the combinatorial core of PCPs. However, the relation is less immediate than commonly believed. Nevertheless, we show that certain PCP systems can be modified to yield locally testable codes. On the other hand, we adapt techniques that we develop for the construction of the latter to yield new PCPs.Our main results are locally testable codes and PCPs of almost-linear length. Specifically, we prove the existence of the following constructs:---Locally testable binary (linear) codes in which
k
information bits are encoded by a codeword of length
k
⋅ exp(Õ(√(log
k
))). This improves over previous results that either yield codewords of exponential length or obtained almost quadratic length codewords for sufficiently large nonbinary alphabet.---PCP systems of almost-linear length for SAT. The length of the proof is
n
⋅ exp(Õ(√(log
n
))) and verification in performed by a constant number (i.e., 19) of queries, as opposed to previous results that used proof length
n
(1 +
O
(1/
q
))
for verification by
q
queries.The novel techniques in use include a random projection of certain codewords and PCP-oracles that preserves local-testability, an adaptation of PCP constructions to obtain “linear PCP-oracles” for proving conjunctions of linear conditions, and design of PCPs with some new soundness properties---a direct construction of locally testable (linear) codes of subexponential length.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
87 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification;SIAM Journal on Computing;2023-12-06
2. Improved Hardness of Approximating k-Clique under ETH;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity;SIAM Journal on Computing;2022-12-16
4. Quantum Tanner codes;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. c3-Locally Testable Codes from Lossless Expanders;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26