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-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.

• Type: Journal
• Year: 2010
• Where: ECCC
• Authors: Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
• Keywords: Constant Number, ECCC 2010, ECommerce, Error Rate, Sub-exponential Length