Abstract
In the previous chapter, we gave a detailed exposition of the point removal method for constructing locally decodable codes and obtained large improvements upon earlier work. We start with a high-level review of our construction of locally decodable codes via point removal that was given earlier in Chapter 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avraham Ben-Aroya, Klim Efremenko, and Amnon Ta-Shma. Local list decoding with a constant number of queries. In 51st IEEE Symposium on Foundations of Computer Science (FOCS), 2010. to appear.
Zeev Dvir, Parikshit Gopalan, and Sergey Yekhanin. Matching vector codes. In 51st IEEE Symposium on Foundations of Computer Science (FOCS), 2010. to appear.
Toshiya Itoh and Yasuhiro Suzuki. New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems, pages 263–270, 2010.
Klim Efremenko. 3-query locally decodable codes of subexponential length. In 41st ACM Symposium on Theory of Computing (STOC), pages 39–44, 2009.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yekhanin, S. (2010). Limitations of the point removal method. In: Locally Decodable Codes and Private Information Retrieval Schemes. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14358-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-14358-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14357-1
Online ISBN: 978-3-642-14358-8
eBook Packages: Computer ScienceComputer Science (R0)