Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constructions of locally testable codes are linear codes, and give error-correcting codes whose duals have (superlinearly) {\em many} small weight codewords. Examining this feature appears to be one of the promising approaches to proving limitation results for (i.e., upper bounds on the rate of) LTCs.

Unfortunately till now it was not even known if LTCs need to be non-trivially redundant, i.e., need to have {\em one} linear dependency among the low-weight codewords in its dual.

In this paper we give the first lower bound of this form, by showing that every positiverate constant query strong LTC must have linearly many redundant low-weight codewords in its dual. We actually prove the stronger claim that the {\em actual test itself} must use a linear number of redundant dual codewords (beyond the minimum number of basis elements required to characterize the code); in other words, non-redundant (in fact, lowredundancy) local testing is impossible.

Our main theorem is a special case of a more general theorem that applies to any tester for an arbitrary linear locally testable code \C. The general theorem can be used, for instance, to provide an arguably simpler proof of the main result of \cite{3CNF} which says that testing random low density parity check (LDPC) codes requires linear query complexity. Informally, our more general theorem says the following. Take any basis B for the dual code of \C that is comprised of words of small support, i.e., every element of B has very few nonzero entries. Then the dual code of \C must contain many words that are \itone not in B, \ittwo have small support, and most importantly, \itthree are a linear combination of a constant fraction of B