Document Open Access Logo

Amortized Locally Decodable Codes for Insertions and Deletions

Authors Jeremiah Blocki , Justin Zhang

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ITC.2025.1.pdf
  • Filesize: 0.96 MB
  • 23 pages
HTML5 Logo HTML (experimental)
LIPIcs.ITC.2025.1.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Coding theory
Keywords
  • Amortized Locally Decodable Codes
  • Insertion and Deletion Errors

Metrics

Abstract

Locally Decodable Codes (LDCs) are error correcting codes which permit the recovery of any single message symbol with a low number of queries to the codeword (the locality). Traditional LDC tradeoffs between the rate, locality, and error tolerance are undesirable even in relaxed settings where the encoder/decoder share randomness or where the channel is resource-bounded. Recent work by Blocki and Zhang initiated the study of Hamming amortized Locally Decodable Codes (aLDCs), which allow the local decoder to amortize their number of queries over the recovery of a small subset of message symbols. Surprisingly, Blocki and Zhang construct asymptotically ideal (constant rate, constant amortized locality, and constant error tolerance) Hamming aLDCs in private-key and resource-bounded settings. While this result overcame previous barriers and impossibility results for Hamming LDCs, it is not clear whether the techniques extend to Insdel LDCs. Constructing Insdel LDCs which are resilient to insertion and/or deletion errors is known to be even more challenging. For example, Gupta (STOC'24) proved that no Insdel LDC with constant rate and error tolerance exists even in relaxed settings. 
Our first contribution is to provide a Hamming-to-Insdel compiler which transforms any amortized Hamming LDC that satisfies a particular property (consecutive interval querying) to amortized Insdel LDC while asymptotically preserving the rate, error tolerance and amortized locality. Prior Hamming-to-Insdel compilers of Ostrovsky and Paskin-Cherniavsky (ICITS'15) and Block et al. (FSTTCS'20) worked for arbitrary Hamming LDCs, but incurred an undesirable polylogarithmic blow-up in the locality. Our second contribution is a construction of an ideal amortized Hamming LDC which satisfies our special property (consecutive interval querying) in the relaxed settings where the sender/receiver share randomness or where the channel is resource bounded. Taken together, we obtain ideal Insdel aLDCs in private-key and resource-bounded settings with constant amortized locality, constant rate and constant error tolerance. This result is surprising in light of Gupta’s (STOC'24) impossibility result which demonstrates a strong separation between locality and amortized locality for Insdel LDCs.

Cite As Get BibTex

Jeremiah Blocki and Justin Zhang. Amortized Locally Decodable Codes for Insertions and Deletions. In 6th Conference on Information-Theoretic Cryptography (ITC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 343, pp. 1:1-1:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITC.2025.1

Author Details

Jeremiah Blocki
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA
Justin Zhang
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA

Funding

  • Blocki, Jeremiah: Supported in part by NSF CAREER Award CNS-2047272.

References

  1. Mohammad Hassan Ameri, Alexander R. Block, and Jeremiah Blocki. Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes. In Clemente Galdi and Stanislaw Jarecki, editors, SCN 22: 13th International Conference on Security in Communication Networks, volume 13409 of Lecture Notes in Computer Science, pages 45-68, Amalfi, Italy, september 12-14 2022. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-031-14791-3_3.
  2. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil P. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. In László Babai, editor, 36th Annual ACM Symposium on Theory of Computing, pages 1-10, Chicago, IL, USA, june 13-16 2004. ACM Press. URL: https://doi.org/10.1145/1007352.1007361.
  3. Alexander R. Block and Jeremiah Blocki. Private and resource-bounded locally decodable codes for insertions and deletions. In 2021 IEEE International Symposium on Information Theory (ISIT), pages 1841-1846, 2021. URL: https://doi.org/10.1109/ISIT45174.2021.9518249.
  4. Alexander R Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, and Minshen Zhu. Locally decodable/correctable codes for insertions and deletions. arXiv preprint arXiv:2010.11989, 2020. URL: https://arxiv.org/abs/2010.11989.
  5. Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, and Minshen Zhu. Exponential lower bounds for locally decodable and correctable codes for insertions and deletions. In 62nd Annual Symposium on Foundations of Computer Science, pages 739-750, Denver, CO, USA, february 7-10 2022. IEEE Computer Society Press. URL: https://doi.org/10.1109/FOCS52979.2021.00077.
  6. Jeremiah Blocki, Shubhang Kulkarni, and Samson Zhou. On locally decodable codes in resource bounded channels. In Yael Tauman Kalai, Adam D. Smith, and Daniel Wichs, editors, ITC 2020: 1st Conference on Information-Theoretic Cryptography, volume 163 of Leibniz International Proceedings in Informatics (LIPIcs), pages 16:1-16:23, Boston, MA, USA, june 17-19 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ITC.2020.16.
  7. Jeremiah Blocki and Justin Zhang. Amortized locally decodable codes, 2025. URL: https://doi.org/10.48550/arXiv.2502.10538.
  8. Jeremiah Blocki and Justin Zhang. Amortized locally decodable codes for insertions and deletions. arXiv preprint, 2025. URL: https://doi.org/10.48550/arXiv.2507.03141.
  9. Alessandro Chiesa, Tom Gur, and Igor Shinkar. Relaxed locally correctable codes with nearly-linear block length and constant query complexity. In Shuchi Chawla, editor, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1395-1411, Salt Lake City, UT, USA, january 5-8 2020. ACM-SIAM. URL: https://doi.org/10.1137/1.9781611975994.84.
  10. Gil Cohen and Tal Yankovitz. Asymptotically-good rlccs with (log n)^(2+o(1)) queries. In 39th Computational Complexity Conference (CCC 2024), pages 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.CCC.2024.8.
  11. Klim Efremenko. 3-query locally decodable codes of subexponential length. In Michael Mitzenmacher, editor, 41st Annual ACM Symposium on Theory of Computing, pages 39-44, Bethesda, MD, USA, May 31 - june 2 2009. ACM Press. URL: https://doi.org/10.1145/1536414.1536422.
  12. Meghal Gupta. Constant query local decoding against deletions is impossible. In Bojan Mohar, Igor Shinkar, and Ryan O'Donnell, editors, 56th Annual ACM Symposium on Theory of Computing, pages 752-763, Vancouver, BC, Canada, june 24-28 2024. ACM Press. URL: https://doi.org/10.1145/3618260.3649655.
  13. Tom Gur, Govind Ramnarayan, and Ron D. Rothblum. Relaxed locally correctable codes. In Anna R. Karlin, editor, ITCS 2018: 9th Innovations in Theoretical Computer Science Conference, volume 94, pages 27:1-27:11, Cambridge, MA, USA, january 11-14 2018. Leibniz International Proceedings in Informatics (LIPIcs). URL: https://doi.org/10.4230/LIPIcs.ITCS.2018.27.
  14. Brett Hemenway and Rafail Ostrovsky. Public-key locally-decodable codes. In David Wagner, editor, Advances in Cryptology - CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 126-143, Santa Barbara, CA, USA, august 17-21 2008. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-540-85174-5_8.
  15. Brett Hemenway, Rafail Ostrovsky, Martin J Strauss, and Mary Wootters. Public key locally decodable codes with short keys. In International Workshop on Approximation Algorithms for Combinatorial Optimization, pages 605-615. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-22935-0_51.
  16. Don Hush and Clint Scovel. Concentration of the hypergeometric distribution. Statistics & Probability Letters, 75(2):127-132, November 2005. URL: https://doi.org/10.1016/j.spl.2005.05.019.
  17. Jonathan Katz and Luca Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In 32nd Annual ACM Symposium on Theory of Computing, pages 80-86, Portland, OR, USA, May 21-23 2000. ACM Press. URL: https://doi.org/10.1145/335305.335315.
  18. Vinayak M. Kumar and Geoffrey Mon. Relaxed local correctability from local testing. In Bojan Mohar, Igor Shinkar, and Ryan O'Donnell, editors, 56th Annual ACM Symposium on Theory of Computing, pages 1585-1593, Vancouver, BC, Canada, june 24-28 2024. ACM Press. URL: https://doi.org/10.1145/3618260.3649611.
  19. Richard J. Lipton. A new approach to information theory. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, STACS '94, pages 699-708, Berlin, Heidelberg, 1994. Springer-Verlag. URL: https://doi.org/10.1007/3-540-57785-8_183.
  20. Rafail Ostrovsky, Omkant Pandey, and Amit Sahai. Private locally decodable codes. Cryptology ePrint Archive, Report 2007/025, 2007. URL: https://eprint.iacr.org/2007/025.
  21. Rafail Ostrovsky, Omkant Pandey, and Amit Sahai. Private locally decodable codes. In Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki, editors, ICALP 2007: 34th International Colloquium on Automata, Languages and Programming, volume 4596 of Lecture Notes in Computer Science, pages 387-398, Wroclaw, Poland, july 9-13 2007. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-540-73420-8_35.
  22. Rafail Ostrovsky and Anat Paskin-Cherniavsky. Locally decodable codes for edit distance. In Anja Lehmann and Stefan Wolf, editors, ICITS 15: 8th International Conference on Information Theoretic Security, volume 9063 of Lecture Notes in Computer Science, pages 236-249, Lugano, Switzerland, May 2-5 2015. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-319-17470-9_14.
  23. L.J. Schulman and D. Zuckerman. Asymptotically good codes correcting insertions, deletions, and transpositions. IEEE Transactions on Information Theory, 45(7):2552-2557, 1999. URL: https://doi.org/10.1109/18.796406.
  24. Sergey Yekhanin et al. Locally decodable codes. Foundations and Trends® in Theoretical Computer Science, 6(3):139-255, 2012. URL: https://doi.org/10.1561/0400000030.
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