Sciweavers

73 search results - page 4 / 15
» Public-Key Locally-Decodable Codes
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Private Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
Rafail Ostrovsky, Omkant Pandey, Amit Sahai
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
11 years 11 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 10 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
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 +...
David P. Woodruff
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 8 months ago
Towards 3-query locally decodable codes of subexponential length
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
ECCC
2006
120views more  ECCC 2006»
13 years 8 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