Local List Decoding with a Constant Number of Queries


Recently Efremenko showed locally-decodable codes of sub-exponential length. That result showed that these codes can handle up to $\frac{1}{3} $ fraction of errors. In this paper we show that the same codes can be locally unique-decoded from error rate $\half-\alpha$ for any $\alpha>0$ and locally list-decoded from error rate $1-\alpha$ for any $\alpha>0… (More)
DOI: 10.1109/FOCS.2010.88


  • Presentations referencing similar topics