Sciweavers

28 search results - page 2 / 6
» Query-Efficient Locally Decodable Codes of Subexponential Le...
Sort
View
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
11 years 7 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
ECCC
2011
188views ECommerce» more  ECCC 2011»
13 years 7 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
ECCC
2010
147views more  ECCC 2010»
13 years 4 days ago
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
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
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...