Abstract
We study the relation between locally testable and locally decodable codes. Locally testable codes (LTCs) are error-correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. Locally decodable codes (LDCs) allow to recover each message entry with high probability by reading only a few entries of a slightly corrupted codeword. A linear code \({\mathcal{C}} \subseteq {\mathbf{F}}_2^n\) is called sparse if \(n \geq 2^{\Omega(\dim({\mathcal{C}}))}\).
It is well-known that LTCs do not imply LDCs and that there is an intersection between these two families. E.g. the Hadamard code is both LDC and LTC. However, it was not known whether LDC implies LTC. We show the following results.
-
Two-transitive codes with a local constraint imply LDCs, while they do not imply LTCs.
-
Every non-sparse LDC contains a large subcode which is not LTC, while every subcode of an LDC remains LDC. Hence, every non-sparse LDC contains a subcode that is LDC but is not LTC.
The above results demonstrate inherent differences between LDCs and LTCs, in particular, they imply that LDCs do not imply LTCs.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Babai, L., Shpilka, A., Stefankovic, D.: Locally testable cyclic codes. In: IEEE (ed.) Proceedings: 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, Cambridge, Massachusetts, October 11-14, pp. 116–125. IEEE Computer Society Press, Los Alamitos (2003)
Ben-Sasson, E., Goldreich, O., Sudan, M.: Bounds on 2-query codeword testing. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 216–227. Springer, Heidelberg (2003)
Ben-Sasson, E., Guruswami, V., Kaufman, T., Sudan, M., Viderman, M.: Locally testable codes require redundant testers. In: IEEE Conference on Computational Complexity, pp. 52–61. IEEE Computer Society, Los Alamitos (2009)
Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF properties are hard to test. SIAM Journal on Computing 35(1), 1–21 (2005)
Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: STOC, pp. 266–275. ACM, New York (2005)
Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. JACM: Journal of the ACM 45 (1998)
Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM 54(3), 12:1–12:44 (2007)
Dvir, Z., Shpilka, A.: Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput. 36(5), 1404–1434 (2007)
Efremenko, K.: 3-query locally decodable codes of subexponential length. In: Mitzenmacher, M. (ed.) STOC, pp. 39–44. ACM, New York (2009)
Goldreich, O.: Short locally testable codes and proofs (survey). Electronic Colloquium on Computational Complexity (ECCC) (014) (2005)
Goldreich, O., Karloff, H.J., Schulman, L.J., Trevisan, L.: Lower bounds for linear locally decodable codes and private information retrieval. Computational Complexity 15(3), 263–296 (2006)
Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost-linear length. Journal of the ACM 53(4), 558–655 (2006)
Gopalan, P.: A note on efremenko’s locally decodable codes. Electronic Colloquium on Computational Complexity (ECCC) (069) (2009)
Grigorescu, E., Kaufman, T., Sudan, M.: 2-transitivity is insufficient for local testability. In: IEEE Conference on Computational Complexity, pp. 259–267. IEEE Computer Society, Los Alamitos (2008)
Guruswami, V.: On 2-query codeword testing with near-perfect completeness. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 267–276. Springer, Heidelberg (2006)
Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: STOC, pp. 80–86 (2000)
Kaufman, T., Sudan, M.: Sparse random linear codes are locally decodable and testable. In: FOCS, pp. 590–600. IEEE Computer Society, Los Alamitos (2007)
Kaufman, T., Sudan, M.: Algebraic property testing: the role of invariance. In: STOC, pp. 403–412. ACM, New York (2008)
Kaufman, T., Wigderson, A.: Symmetric ldpc and local testing. In: ICS (2010)
Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes. Electronic Colloquium on Computational Complexity (ECCC) (059) (2002)
Meir, O.: Combinatorial construction of locally testable codes. In: STOC, pp. 285–294. ACM, New York (2008)
Obata, K.: Optimal lower bounds for 2-query locally decodable linear codes. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 39–50. Springer, Heidelberg (2002)
Shiowattana, Lokam: An optimal lower bound for 2-query locally decodable linear codes. IPL: Information Processing Letters 97 (2006)
Trevisan, L.: Some applications of coding theory in computational complexity, September 23 (2004)
Woodruff: New lower bounds for general locally decodable codes. ECCC: Electronic Colloquium on Computational Complexity, technical reports (2007)
Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. J. ACM 55(1) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaufman, T., Viderman, M. (2010). Locally Testable vs. Locally Decodable Codes. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2010 2010. Lecture Notes in Computer Science, vol 6302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15369-3_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-15369-3_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15368-6
Online ISBN: 978-3-642-15369-3
eBook Packages: Computer ScienceComputer Science (R0)