Skip to main content
Springer Nature Link
Log in

Locally Decodable Codes: A Brief Survey

  • Conference paper
Coding and Cryptology (IWCC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6639))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ben-Aroya, A., Efremenko, K., Ta-Shma, A.: Local list decoding with a constant number of queries. In: 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 715–722 (2010)

    Google Scholar 

  2. Ben-Aroya, A., Efremenko, K., Ta-Shma, A.: A note on amplifying the error-tolerance of locally decodable codes. In: Electronic Colloquium on Computational Complexity (ECCC), TR10-134 (2010)

    Google Scholar 

  3. Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 37–48. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  4. Dvir, Z., Gopalan, P., Yekhanin, S.: Matching vector codes. In: 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 705–714 (2010)

    Google Scholar 

  5. Efremenko, K.: 3-query locally decodable codes of subexponential length. In: 41st ACM Symposium on Theory of Computing (STOC), pp. 39–44 (2009)

    Google Scholar 

  6. Grolmusz, V.: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica 20, 71–86 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Itoh, T., Suzuki, Y.: New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems, 263–270 (2010)

    Google Scholar 

  8. Kopparty, S., Saraf, S., Yekhanin, S.: High-rate codes with sublinear-time decoding. In: 43nd ACM Symposium on Theory of Computing, STOC (2011)

    Google Scholar 

  9. Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: 32nd ACM Symposium on Theory of Computing (STOC), pp. 80–86 (2000)

    Google Scholar 

  10. Lipton, R.: Efficient checking of computations. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 207–215. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  11. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1983)

    MATH  Google Scholar 

  12. Chee, Y.M., Feng, T., Ling, S., Wang, H., Zhang, L.: Query-efficient locally decodable codes of subexponential length. In: Electronic Colloquium on Computational Complexity (ECCC), TR10-173 (2010)

    Google Scholar 

  13. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam

    Google Scholar 

  14. Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IEEE Transactions on Computers 3, 6–12 (1954)

    Google Scholar 

  15. Raghavendra, P.: A note on Yekhanin’s locally decodable codes. In: Electronic Colloquium on Computational Complexity (ECCC), TR07-016 (2007)

    Google Scholar 

  16. Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IEEE Transactions on Information Theory 4, 38–49 (1954)

    MathSciNet  Google Scholar 

  17. Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. In: 39th ACM Symposium on Theory of Computing (STOC), pp. 537–546 (1999)

    Google Scholar 

  18. Saraf, S., Yekhanin, S.: Noisy interpolation of sparse polynomials, and applications. In: 29th IEEE Computational Complexity Conference, CCC (2011)

    Google Scholar 

  19. Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. Journal of the ACM 55, 1–16 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  20. Yekhanin, S.: Locally decodable codes. Foundations and trends in Theoretical Computer Science (2010, to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research Silicon Valley, USA

    Sergey Yekhanin

Authors
  1. Sergey Yekhanin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Physical and Mathematical Sciences, Division of Mathematical Sciences, Nanyang Technological University, 637371, Singapore

    Yeow Meng Chee , San Ling , Huaxiong Wang  & Chaoping Xing , ,  & 

  2. College of Information Engineering, Qingdao University, 266071, Shandong, P.R. China

    Zhenbo Guo

  3. Qingdao University, 266071, Shandong, P.R. China

    Fengjing Shao

  4. School of Mathematical Sciences, Yangzhou University, 225002, Jiangsu, P.R. China

    Yuansheng Tang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yekhanin, S. (2011). Locally Decodable Codes: A Brief Survey. In: Chee, Y.M., et al. Coding and Cryptology. IWCC 2011. Lecture Notes in Computer Science, vol 6639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20901-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20901-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20900-0

  • Online ISBN: 978-3-642-20901-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics