In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...