Document Open Access Logo

Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries

Authors Gil Cohen , Tal Yankovitz

PDF

File

Thumbnail PDF
PDF
LIPIcs.CCC.2024.8.pdf
  • Filesize: 0.79 MB
  • 16 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Error-correcting codes
Keywords
  • Relaxed locally decodable codes
  • Relxaed locally correctable codes
  • RLCC
  • RLDC

Metrics

Abstract

Recently, Kumar and Mon reached a significant milestone by constructing asymptotically good relaxed locally correctable codes (RLCCs) with poly-logarithmic query complexity. Specifically, they constructed n-bit RLCCs with O(log^{69} n) queries. Their construction relies on a clever reduction to locally testable codes (LTCs), capitalizing on recent breakthrough works in LTCs. As for lower bounds, Gur and Lachish (SICOMP 2021) proved that any asymptotically-good RLCC must make Ω̃(√{log n}) queries. Hence emerges the intriguing question regarding the identity of the least value 1/2 ≤ e ≤ 69 for which asymptotically-good RLCCs with query complexity (log n)^{e+o(1)} exist.
In this work, we make substantial progress in narrowing the gap by devising asymptotically-good RLCCs with a query complexity of (log n)^{2+o(1)}. The key insight driving our work lies in recognizing that the strong guarantee of local testability overshoots the requirements for the Kumar-Mon reduction. In particular, we prove that we can replace the LTCs by "vanilla" expander codes which indeed have the necessary property: local testability in the code’s vicinity.

Cite As Get BibTex

Gil Cohen and Tal Yankovitz. Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries. In 39th Computational Complexity Conference (CCC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 300, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.CCC.2024.8

Author Details

Gil Cohen
  • Department of Computer Science, Tel Aviv University, Israel
Tal Yankovitz
  • Department of Computer Science, Tel Aviv University, Israel

Funding

The research leading to these results has received funding from the ERC starting grant 949499 and from the Israel Science Foundation grant 1569/18.

Acknowledgements

We are grateful to Marcel Dall'Agnol and Pedro Paredes for identifying an inaccuracy in our original proof, which has been corrected in this revision.

References

  1. Ron Asherov and Irit Dinur. Bipartite unique-neighbour expanders via Ramanujan graphs. arXiv preprint, 2023. URL: https://arxiv.org/abs/2301.03072.
  2. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM Journal on Computing, 36(4):889-974, 2006. Google Scholar
  3. Eli Ben-Sasson and Michael Viderman. Composition of semi-ltcs by two-wise tensor products. computational complexity, 24:601-643, 2015. Google Scholar
  4. Arnab Bhattacharyya, Sivakanth Gopi, and Avishay Tal. Lower bounds for 2-query LCCs over large alphabet. arXiv preprint, 2016. URL: https://arxiv.org/abs/1611.06980.
  5. Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, and Minshen Zhu. On relaxed locally decodable codes for Hamming and insertion-deletion errors. In 38th Computational Complexity Conference, volume 264 of LIPIcs. Leibniz Int. Proc. Inform., pages Paper No. 14, 25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/lipics.ccc.2023.14.
  6. Manuel Blum and Sampath Kannan. Designing programs that check their work. Journal of the ACM (JACM), 42(1):269-291, 1995. Google Scholar
  7. Clément L Canonne and Tom Gur. An adaptivity hierarchy theorem for property testing. Computational Complexity, 27(4):671-716, 2018. Google Scholar
  8. Michael Capalbo, Omer Reingold, Salil Vadhan, and Avi Wigderson. Randomness conductors and constant-degree lossless expanders. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pages 659-668. ACM, New York, 2002. URL: https://doi.org/10.1145/509907.510003.
  9. Alessandro Chiesa, Tom Gur, and Igor Shinkar. Relaxed locally correctable codes with nearly-linear block length and constant query complexity. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1395-1411. SIAM, 2020. Google Scholar
  10. Gil Cohen and Tal Yankovitz. Rate amplification and query-efficient distance amplification for linear LCC and LDC. In 36th Computational Complexity Conference (CCC 2021). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  11. Gil Cohen and Tal Yankovitz. LCC and LDC: Tailor-made distance amplification and a refined separation. In 49th EATCS International Conference on Automata, Languages, and Programming, volume 229 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 44, 20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/lipics.icalp.2022.44.
  12. Gil Cohen and Tal Yankovitz. Relaxed locally decodable and correctable codes: beyond tensoring. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science - FOCS 2022, pages 24-35. IEEE Computer Soc., Los Alamitos, CA, 2022. Google Scholar
  13. Itay Cohen, Roy Roth, and Amnon Ta-Shma. HDX condensers. In Electronic Colloquium on Computational Complexity (ECCC), 2023. Google Scholar
  14. Marcel Dall'Agnol, Tom Gur, and Oded Lachish. A structural theorem for local algorithms with applications to coding, testing, and privacy. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1651-1665. SIAM, 2021. Google Scholar
  15. Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes. Locally testable codes with constant rate, distance, and locality. In STOC '22 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 357-374. ACM, New York, 2022. Google Scholar
  16. Zeev Dvir, Parikshit Gopalan, and Sergey Yekhanin. Matching vector codes. SIAM Journal on Computing, 40(4):1154-1178, 2011. Google Scholar
  17. Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, and Avi Wigderson. Spanoids - an abstraction of spanning structures, and a barrier for LCCs. SIAM Journal on Computing, 49(3):465-496, 2020. Google Scholar
  18. Klim Efremenko. 3-query locally decodable codes of subexponential length. SIAM Journal on Computing, 41(6):1694-1703, 2012. Google Scholar
  19. Guy Goldberg. Linear relaxed locally decodable and correctable codes do not need adaptivity and two-sided error. In Electron. Colloquium Comput. Complex., 2023. Google Scholar
  20. Oded Goldreich. Lecture notes on locally testable codes and proofs, 2016. URL: https://www.wisdom.weizmann.ac.il/~oded/PDF/pt-ltc.pdf.
  21. Oded Goldreich. On the lower bound on the length of relaxed locally decodable codes. In Electronic Colloquium on Computational Complexity (ECCC), 2023. Google Scholar
  22. Oded Goldreich and Tom Gur. Universal locally verifiable codes and 3-round interactive proofs of proximity for csp. Theoretical Computer Science, 878:83-101, 2021. Google Scholar
  23. Oded Goldreich, Howard Karloff, Leonard J Schulman, and Luca Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. In Proceedings 17th IEEE Annual Conference on Computational Complexity, pages 175-183. IEEE, 2002. Google Scholar
  24. Louis Golowich. New explicit constant-degree lossless expanders. arXiv preprint, 2023. URL: https://arxiv.org/abs/2306.07551.
  25. Sivakanth Gopi, Swastik Kopparty, Rafael Oliveira, Noga Ron-Zewi, and Shubhangi Saraf. Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound. IEEE Transactions on Information Theory, 64(8):5813-5831, 2018. Google Scholar
  26. Alan Guo, Swastik Kopparty, and Madhu Sudan. New affine-invariant codes from lifting. In Proceedings of the 4th conference on Innovations in Theoretical Computer Science, pages 529-540. ACM, 2013. Google Scholar
  27. Tom Gur and Oded Lachish. On the power of relaxed local decoding algorithms. SIAM Journal on Computing, 50(2):788-813, 2021. Google Scholar
  28. Tom Gur, Govind Ramnarayan, and Ron Rothblum. Relaxed locally correctable codes. Theory of Computing, 16(1):1-68, 2020. Google Scholar
  29. Tom Gur and Ron D Rothblum. A hierarchy theorem for interactive proofs of proximity. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  30. Tom Gur and Ron D Rothblum. Non-interactive proofs of proximity. computational complexity, 27(1):99-207, 2018. Google Scholar
  31. Venkatesan Guruswami and Piotr Indyk. Linear-time encodable/decodable codes with near-optimal rate. IEEE Transactions on Information Theory, 51(10):3393-3400, 2005. Google Scholar
  32. Brett Hemenway, Rafail Ostrovsky, and Mary Wootters. Local correctability of expander codes. Information and Computation, 243:178-190, 2015. Google Scholar
  33. Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, and Pedro Paredes. Explicit two-sided unique-neighbor expanders. arXiv preprint, 2023. URL: https://arxiv.org/abs/2302.01212.
  34. Jonathan Katz and Luca Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 80-86, 2000. Google Scholar
  35. Swastik Kopparty, Or Meir, Noga Ron-Zewi, and Shubhangi Saraf. High-rate locally correctable and locally testable codes with sub-polynomial query complexity. Journal of the ACM (JACM), 64(2):11, 2017. Google Scholar
  36. Swastik Kopparty, Shubhangi Saraf, and Sergey Yekhanin. High-rate codes with sublinear-time decoding. Journal of the ACM (JACM), 61(5):28, 2014. Google Scholar
  37. Vinayak Kumar and Geoffrey Mon. Relaxed local correctability from local testing. In Electron. Colloquium Comput. Complex., 2023. Google Scholar
  38. Richard J Lipton. Efficient checking of computations. In Annual Symposium on Theoretical Aspects of Computer Science, pages 207-215. Springer, 1990. Google Scholar
  39. Or Meir. Locally correctable and testable codes approaching the Singleton bound. In Electronic Colloquium on Computational Complexity (ECCC), volume 21(107), page 14, 2014. Google Scholar
  40. Dana Moshkovitz and Ran Raz. Two-query PCP with subconstant error. Journal of the ACM (JACM), 57(5):1-29, 2008. Google Scholar
  41. Pavel Panteleev and Gleb Kalachev. Asymptotically good quantum and locally testable classical LDPC codes. In STOC '22 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 375-388. ACM, New York, 2022. Google Scholar
  42. Noga Ron-Zewi and Ron D Rothblum. Local proofs approaching the witness length. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 846-857. IEEE, 2020. Google Scholar
  43. Michael Sipser and Daniel A. Spielman. Expander codes. IEEE Trans. Inform. Theory, 42(6, part 1):1710-1722, 1996. Codes and complexity. URL: https://doi.org/10.1109/18.556667.
  44. Daniel Alan Spielman. Computationally efficient error-correcting codes and holographic proofs. ProQuest LLC, Ann Arbor, MI, 1995. Thesis (Ph.D.) - Massachusetts Institute of Technology. URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:0576626.
  45. Sergey Yekhanin. Towards 3-query locally decodable codes of subexponential length. Journal of the ACM (JACM), 55(1):1-16, 2008. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact