Sciweavers

28 search results - page 3 / 6
» Query-Efficient Locally Decodable Codes of Subexponential Le...
Sort
View
ECCC
2010
131views more  ECCC 2010»
13 years 6 months ago
High-rate codes with sublinear-time decoding
Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of ...
Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
STACS
2009
Springer
14 years 22 days ago
Locally Decodable Quantum Codes
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that ...
Jop Briet, Ronald de Wolf
ECCC
2006
120views more  ECCC 2006»
13 years 6 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 7 months ago
Public-Key Locally-Decodable Codes
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 ...
Brett Hemenway, Rafail Ostrovsky