Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1012.2738

Dense locally testable codes cannot have constant rate and distance

Irit Dinur·Tali Kaufman
View original source ↗Read source document ↗Export metadata ↓

Abstract

A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important question is whether there exist LTCs that have the ccc-property: constant relative rate, constant relative distance, and that can be tested with a constant number of queries. Such codes are sometimes referred to as "asymptotically good". We show that dense LTCs cannot be ccc. The density of a tester is roughly the average number of distinct local views in which a coordinate participates. An LTC is dense if it has a tester with density >> 1. More precisely, we show that a 3-query locally testable code with a tester of density >> 1 cannot be ccc. Moreover, we show that a q-query locally testable code (q>3) with a tester of density >> n^{q-2} cannot be ccc. Our results hold when the tester has the following two properties: 1) "no weights": Every q-tuple of queries occurs with the same probability. 2) "last-one-fixed": In every `test' of the tester, the value to any q-1 of the symbols determines the value of the last symbol. (Linear codes have constraints of this type). We also show that several natural ways to quantitatively improve our results would already resolve the general ccc-question, i.e. also for non-dense LTCs.

Explore related subjects

cs.CCmath.CO

Keep this discovery

BibTeXRIS

Irit Dinur, Tali Kaufman. 2010-12-13. Dense locally testable codes cannot have constant rate and distance. https://arxiv.org/abs/1012.2738

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗