Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Representing Boolean functions as polynomials modulo composite numbers
Computational Complexity - Special issue on circuit complexity
Journal of the ACM (JACM)
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Constructing set systems with prescribed intersection sizes
Journal of Algorithms
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Hiding Instances in Multioracle Queries
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Checking of Computations
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
A Geometric Approach to Information-Theoretic Private Information Retrieval
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
A computational introduction to number theory and algebra
A computational introduction to number theory and algebra
Computing with polynomials over composites
Computing with polynomials over composites
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
SIAM Journal on Computing
Towards 3-query locally decodable codes of subexponential length
Journal of the ACM (JACM)
Corruption and Recovery-Efficient Locally Decodable Codes
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
3-query locally decodable codes of subexponential length
Proceedings of the forty-first annual ACM symposium on Theory of computing
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
SIAM Journal on Computing
On Matrix Rigidity and Locally Self-Correctable Codes
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Local List Decoding with a Constant Number of Queries
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Noisy Interpolation of Sparse Polynomials, and Applications
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Improved lower bounds for locally decodable codes and private information retrieval
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Locally Decodable Codes
A novel elementary construction of matching vectors
Information Processing Letters
New bounds for matching vector families
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
An $(r,\delta,\epsilon)$-locally decodable code encodes a $k$-bit message $x$ to an $N$-bit codeword $C(x)$, such that for every $i\in[k]$, the $i$th message bit can be recovered with probability $1-\epsilon$, by a randomized decoding procedure that queries only $r$ bits, even if the codeword $C(x)$ is corrupted in up to $\delta N$ locations. Recently a new class of locally decodable codes (LDCs), based on families of vectors with restricted dot products, has been discovered. We refer to those codes as matching vector (MV) codes. Several families of $(r,\delta,\Theta(r\delta))$-locally decodable MV codes have been obtained. While codes in those families were shorter than codes of earlier generations, they suffered from having large values of $\epsilon=\Omega(r\delta)$, which meant that $r$-query MV codes could only handle error rates below $\frac{1}{r}$. Thus larger query complexity gave shorter length codes but at the price of less error tolerance. No MV codes of a superconstant number of queries capable of tolerating a constant fraction of errors were known to exist. In this paper we present a new view of matching vector codes and uncover certain similarities between MV codes and classical Reed-Muller (RM) codes. Our view allows us to obtain deeper insights into the power and limitations of MV codes. Specifically, we obtain the following: (1) We show that existing families of MV codes can be enhanced to tolerate a large constant fraction of errors, independent of the number of queries. Such enhancement comes at a price of a moderate increase in the number of queries. (2) Our construction yields the first families of MV codes of superconstant query complexity that can tolerate a constant fraction of errors. Our codes are shorter than RM LDCs for all values of $r\leq\log k/(\log\log k)^c$, for some constant $c$. (3) We show that any MV code encodes messages of length $k$ to codewords of length at least $k2^{\Omega(\sqrt{\log k})}$. Therefore MV codes do not improve upon RM LDCs for $r\geq(\log k)^{\Omega(\sqrt{\log k})}$.