Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Binary Codes for Correcting Two Edits (2403.11766v2)

Published 18 Mar 2024 in cs.IT and math.IT

Abstract: An edit refers to a single insertion, deletion, or substitution. This paper aims to construct binary codes that can correct two edits. To do this, a necessary and sufficient condition for a code to be two-edit correctable is provided, showing that a code is a two-edit correcting code if and only if it can correct two deletions, up to two substitutions, and one deletion and up to one substitution, separately. This criterion allows for the construction of two-edit correcting codes leveraging these three types of error correcting codes. In the field of constructing codes for correcting two deletions, we present a construction with $4\log n+O(\log\log n)$ redundant bits that can be viewed as a subcode proposed by Guruswami and H{\aa}stad, and provide an alternative proof. Moreover, our two-deletion correcting codes can also correct up to two substitutions after making a slight modification. In the field of constructing codes for correcting one deletion and up to one substitution, we present a construction with $4 \log n+O(\log\log n)$ redundant bits, which outperforms the best previously known results $6 \log n+O(1)$. Leveraging these codes, we obtain a construction of two-edit correcting codes with $6 \log n+O(\log\log n)$ redundant bits. This outperforms the best previously known result, which requires at least $8\log n$ redundant bits. Moreover, we also consider the list-decoding problem under the two-edit channel and construct a two-edit list-decodable code with a list size of two employing $4 \log n+O(\log\log n)$ redundant bits.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. J. Brakensiek, V. Guruswami, and S. Zbarsky, “Efficient low-redundancy codes for correcting multiple deletions,” IEEE Trans. Inf. Theory, vol. 64 no. 5, pp. 3403-3410, 2018.
  2. K. Cheng, Z. Jin, X. Li, and K. Wu, “Deterministic document exchange protocols, and almost optimal binary codes for edit errors,” in Proc. Annu. Symp. Found. Comput. Sci. (FOCS), Paris, France, 2018, pp. 200-211.
  3. R. Gabrys, E. Yaakobi, and O. Milenkovic, “Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction,” IEEE Trans. Inf. Theory, vol. 64, no. 4, pp. 2550-2570, Apr. 2018.
  4. R. Gabrys and F. Sala, “Codes correcting two deletions,” IEEE Trans. Inf. Theory, vol. 65, no. 2, pp. 965-974, Feb. 2019.
  5. R. Gabrys, H. M. Kiah, A. Vardy, E. Yaakobi, and Y. Zhang, “Locally balanced constraints,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Los Angeles, CA, USA, Jun. 2020, pp. 664-669.
  6. R. Gabrys, V. Guruswami, J. Ribeiro, and K. Wu, “Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions,” IEEE Trans. Inf. Theory, vol. 69, no. 1, pp. 169-186, Jan. 2023.
  7. V. Guruswami and J. Håstad, “Explicit two-deletion codes with redundancy matching the existential bound,” IEEE Trans. Inf. Theory, vol. 67, no. 10, pp. 6384-6394, Oct. 2021.
  8. B. Haeupler, “Optimal document exchange and new codes for insertions and deletions,” in Proc. Annu. Symp. Found. Comput. Sci. (FOCS), Baltimore, MD, USA, 2019, pp. 334-347.
  9. R. Heckel, G. Mikutis, and R. N. Grass, “A characterization of the DNA data storage channel,” Scientific Reports, vol. 9, no. 1, pp. 9663, 2019.
  10. T. -H. Khuat, H. Park, and S. Kim, “New Binary Code Design to Correct One Deletion and One Insertion Error,” IEEE Trans. Comm., vol. 71, no. 7, pp. 3807-3820, Jul. 2023.
  11. V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” Soviet Physics Doklady, vol. 10, no. 8, pp. 707-710, Aug. 1966.
  12. Y, Li and F. Farnoud, “Linial’s Algorithm and Systematic Deletion-Correcting Codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Taipei, Taiwan, Jun. 2023, pp. 2703-2707.
  13. T. T. Nguyen, K. Cai,, and K. A. S. Immink, “Efficient Design of Subblock Energy-Constrained Codes and Sliding Window-Constrained Codes,” IEEE Trans. Inf. Theory, vol. 67, no. 12, pp. 7914-7924, Dec. 2021.
  14. C. Schoeny, A. Wachter-Zeh, R. Gabrys, and E. Yaakobi, “Codes correcting a burst of deletions or insertions,” IEEE Trans. Inf. Theory, vol. 63, no. 4, pp. 1971-1985, Apr. 2017.
  15. I. Smagloy, L. Welter, A. Wachter-Zeh, and E. Yaakobi, “Single-deletion single-substitution correcting codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Los Angeles, CA, USA, Jun. 2020, pp. 775-780.
  16. I. Smagloy, L. Welter, A. Wachter-Zeh, and E. Yaakobi, “Single-deletion single-substitution correcting codes,” IEEE Trans. Inf. Theory, 2023, accepted, DOI: 10.1109/TIT.2023.3319088.
  17. J. Sima, N. Retanel, and J. Bruck, “Two Deletion Correcting Codes From differential Vectors,” IEEE Trans. Inf. Theory, vol. 66, no. 4, pp. 2375-2391, Apr. 2020.
  18. J. Sima, R. Gabrys, and J. Bruck, “Optimal systematic t𝑡titalic_t-deletion correcting codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Los Angeles, CA, USA, Jun. 2020, pp. 769-774.
  19. J. Sima and J. Bruck, “On optimal k𝑘kitalic_k-deletion correcting codes,” IEEE Trans. Inf. Theory, vol. 67, no. 6, pp. 3360-3375, 2021.
  20. W. Song, N. Polyanskii, K. Cai, and X. He, “Codes Correcting Multiple-Deletion and Multiple-Substitution Errors,” IEEE Trans. Inf. Theory, vol. 68, no. 10, pp. 6402-6416, Oct. 2022.
  21. W. Song, K. Cai, and T. T. Nguyen, “List-decodable Codes for Single-Deletion Single-Substitution with List-size Two,” arXiv: 2201.02013, 2022.
  22. Y. Sun and G. Ge, “Correcting two-deletion with a constant number of reads,” IEEE Trans. Inf. Theory, vol. 69, no. 5, pp. 2969-2982, May 2023.
  23. Y. Sun, Y. Zhang, and G. Ge, “Improved constructions of permutation and multiation codes correcting a burst of stable deletions”, IEEE Trans. Inf. Theory, vol. 69, no. 7, pp. 4429-4441, Jul. 2023.
  24. Y. Sun, Y. Xi, and G. Ge, “Sequence reconstruction under single-burst-insertion/deletion/edit channel,” IEEE Trans. Inf. Theory, vol. 69, no. 7, pp. 4466-4483, Jul. 2023.
  25. A. Tandon, M. Motani, and L. R. Varshney, “Subblock-constrained codes for real-time simultaneous energy and information transfer,” IEEE Trans. Inf. Theory, vol. 62, no. 7, pp. 4212-4227, Jul. 2016.
  26. C. Wang, Z. Lu, Z. Lan, G. Ge, and Y. Zhang, “Coding schemes for locally balanced constraints,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Espoo, Finland, Jun. 2022, pp. 1342-1347.
Citations (1)
View on Semantic Scholar

Summary

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

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