Locally testable codes and PCPs of almost-linear length
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((O) over tilde (root(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((O) over tilde(root(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.
error-correcting codes verification algorithms theory proof verification probabilistically checkable proofs derandornization