Sciweavers

7 search results - page 2 / 2
» Towards 3-query locally decodable codes of subexponential le...
Sort
View
ECCC
2010
153views more  ECCC 2010»
13 years 10 days ago
Local list decoding with a constant number of queries
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...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
11 years 8 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