Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions (2311.02771v2)

Published 5 Nov 2023 in cs.IT and math.IT

Abstract: Constructing Reed--Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. For the special case of two-dimensional RS-codes, it is known [CST23] that an $[n,2]_q$ RS-code that can correct from $n-3$ insdel errors satisfies that $q=\Omega(n3)$. On the other hand, there are several known constructions of $[n,2]_q$ RS-codes that can correct from $n-3$ insdel errors, where the smallest field size is $q=O(n4)$. In this short paper, we construct $[n,2]_q$ Reed--Solomon codes that can correct $n-3$ insdel errors with $q=O(n3)$, thereby resolving the minimum field size needed for such codes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. Improved field size bounds for higher order mds codes. arXiv preprint arXiv:2212.11262, 2022.
  2. Efficient low-redundancy codes for correcting multiple deletions. IEEE Transactions on Information Theory, 64(5):3403–3410, 2017.
  3. Efficient linear and affine codes for correcting insertions/deletions. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 1–20. SIAM, 2021.
  4. Hao Chen. Coordinate-ordering-free upper bounds for linear insertion-deletion codes. IEEE Transactions on Information Theory, 68(8):5126–5132, 2022.
  5. Linear insertion deletion codes in the high-noise and high-rate regimes. arXiv preprint arXiv:2303.17370, 2023.
  6. Deterministic document exchange protocols, and almost optimal binary codes for edit errors. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 200–211. IEEE, 2018.
  7. Explicit and efficient constructions of linear codes against adversarial insertions and deletions. IEEE Transactions on Information Theory, 68(10):6516–6526, 2022.
  8. Reed–solomon codes against adversarial insertions and deletions. IEEE Transactions on Information Theory, 2023.
  9. Improved Singleton bound on insertion-deletion codes and optimal constructions. arXiv preprint arXiv:2105.02004, 2021.
  10. Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. arXiv preprint arXiv:1909.03426, 2019.
  11. Explicit two-deletion codes with redundancy matching the existential bound. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 21–32. SIAM, 2021.
  12. Optimally resilient codes for list-decoding from insertions and deletions. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 524–537, 2020.
  13. Repairing reed-solomon codes. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 216–226, 2016.
  14. Deletion codes in the high-noise and high-rate regimes. IEEE Transactions on Information Theory, 63(4):1961–1970, 2017.
  15. Bernhard Haeupler. Optimal document exchange and new codes for insertions and deletions. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 334–347. IEEE, 2019.
  16. A characterization of the DNA data storage channel. Scientific reports, 9(1):1–12, 2019.
  17. Synchronization strings: codes for insertions and deletions approaching the Singleton bound. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 33–46. ACM, 2017.
  18. Synchronization strings and codes for insertions and deletions - A survey. IEEE Trans. Inf. Theory, 67(6):3190–3206, 2021.
  19. Strict half-singleton bound, strict direct upper bound for linear insertion-deletion codes and optimal codes. IEEE Transactions on Information Theory, 2023.
  20. Coding over sets for dna storage. IEEE Transactions on Information Theory, 66(4):2331–2351, 2019.
  21. On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability. Finite Fields and Their Applications, 73:101841, 2021.
  22. Explicit construction of q-ary 2-deletion correcting codes with low redundancy. arXiv preprint arXiv:2306.02868, 2023.
  23. Bounds and constructions for insertion and deletion codes. IEEE Transactions on Information Theory, 2022.
  24. On sharing secrets and Reed-Solomon codes. Communications of the ACM, 24(9):583–584, 1981.
  25. Information-theoretic foundations of dna data storage. Foundations and Trends® in Communications and Information Theory, 19(1):1–106, 2022.
  26. Traitor tracing for shortened and corrupted fingerprints. In ACM workshop on Digital Rights Management, pages 81–100. Springer, 2002.
  27. Tan Jin Soon. QR code. Synthesis Journal, 2008:59–78, 2008.
  28. Codes correcting a burst of deletions or insertions. IEEE Transactions on Information Theory, 63(4):1971–1985, 2017.
  29. A family of optimal locally recoverable codes. IEEE Transactions on Information Theory, 60(8):4661–4676, 2014.
  30. Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes. Designs, Codes and Cryptography, 42(2):227–237, 2007.
  31. Deletion correcting using generalized Reed-Solomon codes. In Coding, Cryptography and Combinatorics, pages 345–358. Springer, 2004.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets