29 search results - page 2 / 6 » 3-query locally decodable codes of subexponential length |
ECCC
2010
13 years 1 months ago
2010
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...
STOC
2012
ACM
11 years 8 months ago
2012
ACM
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...
ECCC
2010
13 years 1 months ago
2010
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...
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
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...
ECCC
2010
13 years 6 months ago
2010
Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of ...