A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field-Reference-Cited by-同舟云学术

A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field

Published:2012-07 Issue:4 Volume:27 Page:678-686
ISSN:1000-9000
Container-title:Journal of Computer Science and Technology
language:en
Short-container-title:J. Comput. Sci. Technol.

Author:

Woodruff David P.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11390-012-1254-8.pdf

Reference22 articles.

1. Sipser M, Spielman D A. Expander codes. IEEE Trans. Inform. Theory, 1996, 42(6): 1710–1722.

2. Katz J, Trevisan L. On the efficiency of local decoding procedures for error-correcting codes. In Proc. the 32d STOC, May 2000, pp.80–86.

3. Goldreich O, Karloff H J, Schulman L J, Trevisan L. Lower bounds for linear locally decodable codes and private information retrieval. In Proc. the 17th CCC, May 2002, pp.175–183.

4. Trevisan L. Some applications of coding theory in computational complexity. Quaderni di Matematica, 2004, 13: 347–424.

5. Yekhanin S. Locally decodable codes and private information retrieval schemes [PhD thesis]. MIT, 2007.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computationally Relaxed Locally Decodable Codes, Revisited;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

2. A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Lower bounds on the redundancy of linear codes with disjoint repair groups;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26

4. Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. Lifted Reed-Solomon Codes and Lifted Multiplicity Codes;IEEE Transactions on Information Theory;2021-12