Oded Goldreich
Madhu Sudan
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.
- Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., and Ron, D. 2003. Testing low-degree polynomials over GF(2). In Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003). Lecture Notes in Computer Science, vol. 2754, Springer, New York, 188--199.Google Scholar
- Arora, S., Lund, C., Motwani, R., Sudan M., and Szegedy, M. 1998. Proof verification and the hardness of of approximation problems. J. ACM, 45, 3 (May), 501--555. Google Scholar
- Arora, S., and Safra, S. 1998. Probabilistic checkable proofs: A new characterization of NP. J. ACM 45, 1 (Jan.), 70--122. Google Scholar
- Arora, S., and Sudan, M. 2003. Improved low degree testing and its applications. Combinatorica 23, 3, 365--426.Google Scholar
- Babai, L., Fortnow, L., Levin, L., and Szegedy, M. 1991a. Checking computations in polylogarithmic time. In Proceedings of the 23rd ACM Symposium on the Theory of Computing. ACM, New York, 21--31. Google Scholar
- Babai, L., Fortnow, L., and Lund. C. 1991b. Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex. 1, 13--40.Google Scholar
- Bellare, M., Coppersmith, D., Håstad, J., Kiwi, M., and Sudan, M. 1996. Linearity testing over characteristic two. IEEE Trans. Info. Theory 42, 6 (Nov.), 1781--1795. Google Scholar
- Bellare, M. Goldreich, O., and Sudan, M. 1998. Free bits, PCPs, and nonapproximability---towards tight results. SIAM J. Comput. 27, 3, 804--915. Google Scholar
- Bellare, M., Goldwasser, S., Lund, C., and Russell, A. 1993. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th ACM Symposium on the Theory of Computing ACM, New York, 294--304. Google Scholar
- Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., and Vadhan, S. 2004. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proceedings of the 36th ACM Symposium on the Theory of Computing ACM, New York, 1--10. Google Scholar
- Ben-Sasson, E., Goldreich, O., and Sudan, M. 2003a. Bounds on 2-query codeword testing. In Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003). Lecture Notes in Computer Science, Vol. 2764. Springer, New York, 216--227.Google Scholar
- Ben-Sasson, E., and Sudan, M. 2005. Short PCPs with poly-log rate and query complexity. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing. ACM, New York, 266--275. Google Scholar
- Ben-Sasson, E., Sudan, M. Vadhan, S., and Wigderson, A. 2003b. Randomness-efficient low degree tests and short PCPs via ε biased sets. In Proceedings of the 35th ACM Symposium on the Theory of Computing. ACM, New York, 612--621. Google Scholar
- Blum, M., Luby, M., and Rubinfeld, R. 1993. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 3, 549--595. Google Scholar
- Creignou, N., Khanna, S., and Sudan, M. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Press, Philadeplhia, PA. Google Scholar
- Dinur, I. 2006. The PCP theorem by gap amplification. In Proceedings of the 38th ACM Symposium on the Theory of Computing. ACM, New York, 241--250. Google Scholar
- Dinur, I., and Reingold, O. 2004. Assignment-testers: Towards a combinatorial proof of the PCP-theorem. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE. Computer Society Press, Los Alamitos, CA, 155--164. Google Scholar
- Even, S., Selman, A. L., and Yacobi, Y. 1984. The complexity of promise problems with applications to public-key cryptography. Info. Control 61, 2 (May), 159--173. Google Scholar
- Feige, U., Goldwasser, S. Lovász, L., Safra, S., and Szegedy, M. 1996. Interactive proofs and the hardness of approximating cliques. J. ACM, 43, 268--292. Google Scholar
- Forney, Jr., G. D. 1966. Concatenated Codes. MIT Press, Cambridge, MA.Google Scholar
- Friedl, K., and Sudan, M. 1995. Some improvements to low-degree tests. In Proceedings of the 3rd Annual Israel Symposium on Theory and Computing Systems, (Washington, DC). Google Scholar
- Goldreich, O., Goldwasser, S., and D. Ron. 1998. Property testing and its connection to learning and approximation. J. ACM, 653--750. Google Scholar
- Goldreich, O, Karloff, H., Schulman, L. J., and Trevisan, L. 2002. Lower bounds for linear locally decodable codes and private information retrieval. In the Proceedings of the 17th IEEE Conference on Computational Complexity. IEEE, Computer Society Press, Los Alamitos, CA, 175--183. Google Scholar
- Goldreich, O., and Sudan, M. 2002. Locally testable codes and PCPs of almost-linear length tech. Rep. TR02-050, ECCC.Google Scholar
- Harsha, P., and Sudan. M. 2000. Small PCPs with low query complexity. Computat. Complex. 9, (3--4), 157--201.Google Scholar
- Håstad, J. 1999. Clique is hard to approximate within n1 − ε. Acta Math. 182, 105--142.Google Scholar
- Katz, J., and Trevisan, L. 2000. On the efficiency of local decoding procedures for error-correcting codes. In STOC'00: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York, 80--86. Google Scholar
- Kiwi, M. 2003. Algebraic testing and weight distribution of dual codes. TR97-010.Google Scholar
- Motwani, R., and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press. Google Scholar
- Polishchuk, A., and Spielman, D. A. 1994. Nearly-linear size holographic proofs. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM, New York, 194--203. Google Scholar
- Raz, R., and Safra, S. 1997. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing. ACM, New York, 475--484. Google Scholar
- Rubinfeld, R., and Sudan, M. 1996. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, (2) (Apr.), 252--271. Google Scholar
Index Terms
- Locally testable codes and PCPs of almost-linear length
Recommendations
Combinatorial PCPs with Efficient Verifiers
The PCP theorem asserts the existence of proofs that can be verified by a verifier that reads only a very small part of the proof. The theorem was originally proved by Arora and Safra (J. ACM 45(1)) and Arora et al. (J. ACM 45(3)) using sophisticated ...
Languages with efficient zero-knowledge PCPs are in SZK
TCC'13: Proceedings of the 10th theory of cryptography conference on Theory of CryptographyA Zero-Knowledge PCP (ZK-PCP) is a randomized PCP such that the view of any (perhaps cheating) efficient verifier can be efficiently simulated up to small statistical distance. Kilian, Petrank, and Tardos (STOC '97) constructed ZK-PCPs for all languages ...
Locally Testable Codes and PCPs of Almost-Linear Length
FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer ScienceLocally testable codes are error-correcting codes that admit very efficient codeword tests. Specifically, using a constant number of (random) queries, non-codewords are rejected with probability proportional to their distance from the code.Locally ...
Comments