DMCA
Local list decoding with a constant number of queries (2010)
Cached
Download Links
by
Avraham Ben-aroya
,
Klim Efremenko
,
Amnon Ta-shma
| Citations: | 5 - 0 self |
BibTeX
@MISC{Ben-aroya10locallist,
author = {Avraham Ben-aroya and Klim Efremenko and Amnon Ta-shma},
title = {Local list decoding with a constant number of queries},
year = {2010}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Recently Efremenko showed locally-decodable codes of sub-exponential length. That result showed that these codes can handle up to 1 3 fraction of errors. In this paper we show that the same codes can be locally unique-decoded from error rate 1 2 − α for any α> 0 and locally list-decoded from error rate 1 − α for any α> 0, with only a constant number of queries and a constant alphabet size. This gives the first sub-exponential codes that can be locally list-decoded with a constant number of queries. 1
