Years and Authors of Summarized Original Work
1990; Blum, Luby, Rubinfeld
2002; Goldreich, Sudan
Problem Definition
Locally testable codes (LTC) are error-correcting codes that support algorithms which can distinguish valid codewords from words that are “far” from all codewords by probing a given word only at a sublinear (typically constant) number of locations. LTCs are useful in the following scenario. Suppose data is transmitted by encoding it using a LTC. Then, one could check if the received data is nearly uncorrupted or has been considerably corrupted by making very few probes into the received data.
An error-correcting code \(\mathcal{C} :\{ 0,1\}^{k} \rightarrow \{ 0,1\}^{n}\) is a function mapping k-bit messages to n-bit codewords. The ratio k∕n is referred to as the rate of the code \(\mathcal{C}\). The Hamming distance between two n-bit strings x and y, denoted by Δ(x, y), is the number of locations where x and y disagree, i.e., Δ(x, y) = { i ∈ [n]∣x i ≠ y i }. The relative...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Arora S (1994) Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, University of California, Berkeley
Babai L, Fortnow L, Levin LA, Szegedy M (1991) Checking computations in polylogarithmic time. In: Proceedings of the 23rd ACM symposium on theory of computing (STOC), pp 21–31. doi:10.1145/103418.103428
Bellare M, Coppersmith D, Håstad J, Kiwi MA, Sudan M (1996) Linearity testing in characteristic two. IEEE Trans Inf Theory 42(6):1781–1795. doi:10.1109/18.556674, (Preliminary version in 36th FOCS, 1995)
Ben-Sasson E (2010) Limitation on the rate of families of locally testable codes. In: [12], pp 13–31. doi:10.1007/978-3-642-16367-8_3
Ben-Sasson E, Sudan M (2008) Short PCPs with polylog query complexity. SIAM J Comput 38(2):551–607. doi:10.1137/050646445, (Preliminary version in 37th STOC, 2005)
Ben-Sasson E, Harsha P, Raskhodnikova S (2005) Some 3CNF properties are hard to test. SIAM J Comput 35(1):1–21. doi:10.1137/S0097539704445445, (Preliminary version in 35th STOC, 2003)
Ben-Sasson E, Goldreich O, Harsha P, Sudan M, Vadhan S (2006) Robust PCPs of proximity, shorter PCPs and applications to coding. SIAM J Comput 36(4):889–974. doi:10.1137/S0097539705446810, (Preliminary version in 36th STOC, 2004)
Blum M, Luby M, Rubinfeld R (1993) Self-testing/correcting with applications to numerical problems. J Comput Syst Sci 47(3):549–595. doi:10.1016/0022-0000(93)90044-W, (Preliminary version in 22nd STOC, 1990)
Dinur I (2007) The PCP theorem by gap amplification. J ACM 54(3):12. doi:10.1145/1236457.1236459, (Preliminary version in 38th STOC, 2006)
Friedl K, Sudan M (1995) Some improvements to total degree tests. In: Proceedings of the 3rd Israel symposium on theoretical and computing systems, pp 190–198. Corrected version available online at http://theory.lcs.mit.edu/~madhu/papers/friedl.ps
Gemmell P, Lipton RJ, Rubinfeld R, Sudan M, Wigderson A (1991) Self-testing/correcting for polynomials and for approximate functions. In: Proceedings of the 23rd ACM symposium on theory of computing (STOC), pp 32–42. doi:10.1145/103418.103429
Goldreich O (ed) (2010) Property testing (Current research and surverys). Lecture notes in computer science, vol 6390. Springer, Berlin
Goldreich O (2010) Short locally testable codes and proofs: a survey in two parts. In: [12], pp 65–104. doi:10.1007/978-3-642-16367-8_6
Goldreich O, Sudan M (2006) Locally testable codes and PCPs of almost linear length. J ACM 53(4):558–655. doi:10.1145/1162349.1162351, (Preliminary Verison in 43rd FOCS, 2002)
Kaufman T, Litsyn S (2005) Almost orthogonal linear codes are locally testable. In: Proceedings of the 46th IEEE symposium on foundations of computer science (FOCS), pp 317–326. doi:10.1109/SFCS.2005.16
Meir O (2009) Combinatorial construction of locally testable codes. SIAM J Comput 39(2):491–544. doi:10.1137/080729967, (Preliminary version in 40th STOC, 2008)
Rubinfeld R, Sudan M (1996) Robust characterizations of polynomials with applications to program testing. SIAM J Comput 25(2):252–271. doi:10.1137/S0097539793255151, (Preliminary version in 23rd STOC, 1991 and 3rd SODA, 1992)
Spielman DA (1995) Computationally efficient error-correcting codes and holographic proofs. PhD thesis, Massachusetts Institute of Technology. http://www.cs.yale.edu/homes/spielman/Research/thesis.html
Trevisan L (2004) Some applications of coding theory in computational complexity. Quaderni di Matematica 13:347–424. cs/0409044
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Harsha, P. (2016). Locally Testable Codes. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_707
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_707
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering