@inproceedings{edb2cf5584a142acbde3a27a78247355,
title = "Local list-decoding with a constant number of queries",
abstract = "Efremenko showed locally-decodable codes of subexponential length that can handle close to 1/6 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 length codes that can be locally list-decoded with a constant number of queries.",
keywords = "List-decoding, Locally-decodable codes",
author = "Avraham Ben-Aroya and Klim Efremenko and Amnon Ta-Shma",
year = "2010",
month = jan,
day = "1",
doi = "10.1109/FOCS.2010.88",
language = "English",
isbn = "9780769542447",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "715--722",
booktitle = "Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010",
address = "United States",
note = "2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010 ; Conference date: 23-10-2010 Through 26-10-2010",
}