On the efficiency of local decoding procedures for error-correcting codes

Information-Theoretic Private Information Retrieval: A Unified Construction

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,

Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes

RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Extractors: optimal up to constant factors

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Robust pcps of proximity, shorter pcps and applications to coding

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Batch codes and their applications

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Journal of Computer and System Sciences - Special issue: STOC 2003

Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

General constructions for information-theoretic private information retrieval

Journal of Computer and System Sciences

The Complexity of Online Memory Checking

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

On basing one-way functions on NP-hardness

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

An optimal lower bound for 2-query locally decodable linear codes

Information Processing Letters

Lower bounds for adaptive locally decodable codes

Random Structures & Algorithms

Locally testable codes and PCPs of almost-linear length

Journal of the ACM (JACM)

Towards 3-query locally decodable codes of subexponential length

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Interpolation of depth-3 arithmetic circuits with two multiplication gates

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Quantum list decoding from quantumly corrupted codewords for classical block codes of polynomially small rate

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65

Towards 3-query locally decodable codes of subexponential length

Journal of the ACM (JACM)

Public-Key Locally-Decodable Codes

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology

The Complexity of Local List Decoding

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

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

The complexity of online memory checking

Journal of the ACM (JACM)

3-query locally decodable codes of subexponential length

Proceedings of the forty-first annual ACM symposium on Theory of computing

Sound 3-Query PCPPs Are Long

ACM Transactions on Computation Theory (TOCT)

An optimal lower bound for 2-query locally decodable linear codes

Information Processing Letters

Private information retrieval

Communications of the ACM

Two-query PCP with subconstant error

Journal of the ACM (JACM)

Some applications of polynomials for the design of cryptographic protocols

SCN'02 Proceedings of the 3rd international conference on Security in communication networks

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

A quadratic lower bound for three-query linear locally decodable codes over any field

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Local Monotonicity Reconstruction

SIAM Journal on Computing

Short locally testable codes and proofs: a survey in two parts

Property testing

Local property reconstruction and monotonicity

Property testing

Short locally testable codes and proofs: a survey in two parts

Property testing

Local property reconstruction and monotonicity

Property testing

High-rate codes with sublinear-time decoding

Proceedings of the forty-third annual ACM symposium on Theory of computing

Locally decodable codes: a brief survey

IWCC'11 Proceedings of the Third international conference on Coding and cryptology

Short locally testable codes and proofs

Studies in complexity and cryptography

On sums of locally testable affine invariant properties

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

Limits on the rate of locally testable affine-invariant codes

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

Public key locally decodable codes with short keys

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

How to tell if your cloud files are vulnerable to drive crashes

Proceedings of the 18th ACM conference on Computer and communications security

Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length

ACM Transactions on Computation Theory (TOCT)

Matching Vector Codes

SIAM Journal on Computing

Space-efficient local computation algorithms

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Improved lower bounds for locally decodable codes and private information retrieval

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantum online memory checking

TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography

A novel elementary construction of matching vectors

Information Processing Letters

From irreducible representations to locally decodable codes

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Private locally decodable codes

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

New bounds for matching vector families

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

A new family of locally correctable codes based on degree-lifted algebraic geometry codes

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

Locally testable codes and cayley graphs

Proceedings of the 5th conference on Innovations in theoretical computer science