2011 IEEE 26th Annual Conference on Computational Complexity (2011)
San Jose, California USA
June 8, 2011 to June 11, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2011.9
The main open problem in the area of locally testable codes (LTCs) is whether there exists an asymptotically good family of LTCs and to resolve this question it suffices to consider the case of query complexity $3$. We argue that to refute the existence of such an asymptotically good family one should prove that the number of dual codewords of weight at most $3$ is super-linear in the blocklength of the code. The main technical contribution of this paper is an improvement of the combinatorial lemma of Goldreich et al.  which bounds the rate of $2$-query locally decodable codes (LDCs) and is used in state-of-the-art rate-bounds for linear LDCs. The lemma of Goldreich et al. bounds the rate of $2$-query LDCs of blocklength $n$ in terms of the corruption parameter $\delta(n)$ --- this is the maximal fraction of corrupted codeword bits for which a ($2$-query) decoder can recover correctly every message bit (with high probability). Our combinatorial lemma gives nontrivial rate bounds for any corruption parameter $\delta(n)$ such that $\delta(n) \cdot n =\omega(1)$, whereas the previous lemma works only for corruption parameter $\delta(n)$ such that $\delta(n) \cdot n \geq \log n$. The study of LDCs with sublinear corruption parameter is also motivated by Dvir's  observation that sufficiently strong bounds on the rate of such LDCs imply explicit constructions of rigid matrices.
linear codes, locally testable codes, locally decodable codes, LDPC codes, lower bounds
E. Ben-Sasson and M. Viderman, "Towards Lower Bounds on Locally Testable Codes via Density Arguments," 2011 IEEE 26th Annual Conference on Computational Complexity(CCC), San Jose, California USA, 2011, pp. 66-76.