Optimal Codes Correcting a Substring Edit
The substring edit error replaces a substring <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">u</i> of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">x</i> with another string <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">v</i>, where the lengths of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">u</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">v</i> are bounded by a given constant <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i>. It encompasses localized insertions, deletions, and substitutions within a window. Codes correcting one substring edit have redundancy at least log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> + <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i>. In this paper, we construct codes correcting one substring edit with redundancy log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> + <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O<sub>k</sub></i>(log log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>), which is almost optimal. We also study the average-case document-exchange problem under one substring edit and construct a hash with an expected length of approximately 2 log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> + <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O<sub>k</sub></i>(log log <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>) for any iid distribution for the documents.
Authors
- Ryan Gabrys (ORCID: https://orcid.org/0000-0002-9197-3371)
- Farzad Farnoud (ORCID: https://orcid.org/0000-0002-8684-4487)
- Yuanyuan Tang (ORCID: https://orcid.org/0000-0003-2946-7782)
- Yuting Li
- Hao Lou (ORCID: https://orcid.org/0000-0002-6133-2987)
Institutions
- University of San Diego (US)
- University of California San Diego (US)
- University of Virginia (US)
Publication Details
- Journal
- IEEE Transactions on Information Theory
- Published
- 2025-04-21
- DOI
- https://doi.org/10.1109/tit.2025.3562730
- Primary Topic
- DNA and Biological Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation