Exact Reconstruction From Insertions in Synchronization Codes
From MaRDI portal
Publication:5280904
Abstract: This work studies problems in data reconstruction, an important area with numerous applications. In particular, we examine the reconstruction of binary and non-binary sequences from synchronization (insertion/deletion-correcting) codes. These sequences have been corrupted by a fixed number of symbol insertions (larger than the minimum edit distance of the code), yielding a number of distinct traces to be used for reconstruction. We wish to know the minimum number of traces needed for exact reconstruction. This is a general version of a problem tackled by Levenshtein for uncoded sequences. We introduce an exact formula for the maximum number of common supersequences shared by sequences at a certain edit distance, yielding an upper bound on the number of distinct traces necessary to guarantee exact reconstruction. Without specific knowledge of the codewords, this upper bound is tight. We apply our results to the famous single deletion/insertion-correcting Varshamov-Tenengolts (VT) codes and show that a significant number of VT codeword pairs achieve the worst-case number of outputs needed for exact reconstruction. We also consider extensions to other channels, such as adversarial deletion and insertion/deletion channels and probabilistic channels.
Cited in
(5)- Balanced reconstruction codes for single edits
- Sequence reconstruction problem for deletion channels: a complete asymptotic solution
- New dimension-independent upper bounds on linear insdel codes
- Reconstruction of permutations distorted by single Kendall \(\tau\)-errors
- Information-Theoretic Foundations of DNA Data Storage
This page was built for publication: Exact Reconstruction From Insertions in Synchronization Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280904)
