Locally decodable codes are error correcting codes that simultaneously provide efficient random-access to encoded data and high noise resilience by allowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. Local decodability comes at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes require longer codeword lengths than their classical counterparts. In this work we briefly survey the recent progress in constructions of locally decodable codes. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Yekhanin, S. (2011). Locally decodable codes: A brief survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6639 LNCS, pp. 273–282). https://doi.org/10.1007/978-3-642-20901-7_18
Mendeley helps you to discover research relevant for your work.