Abstract
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword, looking at very few locations of the input in doing so. Locally testable codes (LTCs) have generated a lot of interest over the years, in large part due to their connection to Probabilistically checkable proofs (PCPs). The ability to correct errors that occur during transmission is one of the big advantages of using a code. Hence, from a coding-theoretic angle, local testing is potentially more useful if in addition to accepting codewords, it also accepts strings that are close to a codeword (in contrast, local testers can have arbitrary behavior on such strings, which potentially annuls the benefits of error-correction). This would imply that when the tester accepts, one can follow-up the testing with a (more expensive) decoding procedure to correct the errors and recover the transmitted codeword, while if the tester rejects, we can save the effort of running the more expensive decoding algorithm.
In this work, we define such testers, which we call tolerant testers following some recent work in property testingĀ [13]. We revisit some recent constructions of LTCs and show how one can make them locally testable in a tolerant sense. While we do not optimize the parameters, the main message from our work is that there are explicit tolerant LTCs with similar parameters to LTCs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the intractibility of approximation problems. Journal of the ACMĀ 45(3), 501ā555 (1998)
Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACMĀ 45(1), 70ā122 (1998)
Babai, L., Shpilka, A., Stefankovic, D.: Locally testable cyclic codes. In: Proceedings of 44th Annual Symposium on Foundations of Computer Science (FOCS), pp. 116ā125 (2003)
Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.: Robust PCPs of proximity, shorter PCPs and application to coding. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 1ā10 (2004)
Ben-Sasson, E., Sudan, M.: Robust locally testable codes and products of codes. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.Ā 3122, pp. 286ā297. Springer, Heidelberg (2004)
Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: Proceedings of 37th ACM Symposium on Theory of Computing (STOC), pp. 266ā275 (2005)
Dinur, I.: The PCP theorem by gap amplification. In ECCC Technical Report TR05-046 (2005)
Fischer, E., Fortnow, L.: Tolerant versus intolerant testing for boolean properties. In: Proceedings of the 20th IEEE Conference on Computational Complexity (2005) (to appear)
Friedl, K., Sudan, M.: Some improvements to total degree tests. In: Proceedings of the 3rd Israel Symp. on Theory and Computing Systems (ISTCS), pp. 190ā198 (1995)
Goldreich, O.: Short locally testable codes and proofs (Survey). ECCC Technical Report TR05-014 (2005)
Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost linear length. In: Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS), pp. 13ā22 (2002)
Kaufman, T., Ron, D.: Testing polynomials over general fields. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 413ā422 (2004)
Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. In ECCC Technical Report TR04-010 (2004)
Polishchuk, A., Spielman, D.A.: Nearly-linear size holographic proofs. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), pp. 194ā203 (1994)
Sipser, M., Spielman, D.: Expander codes. IEEE Transactions on Information TheoryĀ 42(6), 1710ā1722 (1996)
Sudan, M.: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. LNCS, vol.Ā 1001. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guruswami, V., Rudra, A. (2005). Tolerant Locally Testable Codes. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2005 2005. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538462_26
Download citation
DOI: https://doi.org/10.1007/11538462_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28239-6
Online ISBN: 978-3-540-31874-3
eBook Packages: Computer ScienceComputer Science (R0)