Sciweavers

103 search results - page 4 / 21
» Private Locally Decodable Codes
Sort
View
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
15 years 3 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
ECCC
2010
73views more  ECCC 2010»
14 years 11 months ago
Matching Vector Codes
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 ...
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
13 years 2 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
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
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 1 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