Sciweavers

APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
14 years 2 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