Combinatorial construction of locally testable codes
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing Fourier Dimensionality and Sparsity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Composition of Semi-LTCs by Two-Wise Tensor Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Succinct Representation of Codes with Applications to Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Tolerant Linearity Testing and Locally Testable Codes
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Low rate is insufficient for local testability
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Locally testable vs. locally decodable codes
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Guest column: testing linear properties: some general theme
ACM SIGACT News
Limitation on the rate of families of locally testable codes
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
We show that random sparse binary linear codes are locally testable and locally decodable (under any linear encoding) with constant queries (with probability tending to one). By sparse, we mean that the code should have only polynomially many codewords. Our results are the first to show that local decodability and testability can be found in random, unstructured, codes. Previously known locally decodable or testable codes were either classical algebraic codes, or new ones constructed very carefully. We obtain our results by extending the techniques of Kaufman and Litsyn [11] who used the MacWilliams Identities to show that "almost-orthogonal" binary codes are locally testable. Their definition of almost orthogonality expected codewords to disagree in \frac{n} {2} \pm {\rm O}(\sqrt n ) coordinates in codes of block length n. The only families of codes known to have this property were the dual-BCH codes. We extend their techniques, and simplify them in the process, to include codes of distance at least \frac{n} {2} - {\rm O}(n^{1 - \gamma } ) for any \gamma\le 0, provided the number of codewords is {\rm O}(n^t ) for some constant t. Thus our results derive the local testability of linear codes from the classical coding theory parameters, namely the rate and the distance of the codes. More significantly, we show that this technique can also be used to prove the "self-correctability" of sparse codes of sufficiently large distance. This allows us to show that random linear codes under linear encoding functions are locally decodable. This ought to be surprising in that the definition of a code doesn't specify the encoding function used! Our results effectively say that any linear function of the bits of the codeword can be locally decoded in this case.