Sciweavers

73 search results - page 5 / 15
» Public-Key Locally-Decodable Codes
Sort
View
ICALP
2005
Springer
15 years 5 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
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...
Stephanie Wehner, Ronald de Wolf
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
16 years 7 days ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko
CORR
2010
Springer
230views Education» more  CORR 2010»
14 years 8 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
ECCC
2010
140views more  ECCC 2010»
14 years 6 months ago
Query-Efficient Locally Decodable Codes
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
79
Voted
STOC
2003
ACM
118views Algorithms» more  STOC 2003»
15 years 12 months ago
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Iordanis Kerenidis, Ronald de Wolf