Sciweavers

110 search results - page 3 / 22
» Locally Decodable Quantum Codes
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 6 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
13 years 7 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
ECCC
2011
188views ECommerce» more  ECCC 2011»
13 years 22 days ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 5 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...