An overview of capacity results for synchronization channels
M Cheraghchi, J Ribeiro - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
Synchronization channels, such as the well-known deletion channel, are surprisingly harder
to analyze than memoryless channels, and they are a source of many fundamental problems …
to analyze than memoryless channels, and they are a source of many fundamental problems …
Synchronization strings and codes for insertions and deletions—A survey
B Haeupler, A Shahrasbi - IEEE Transactions on Information …, 2021 - ieeexplore.ieee.org
Already in the 1960s, Levenshtein and others studied error-correcting codes that protect
against synchronization errors, such as symbol insertions and deletions. However, despite …
against synchronization errors, such as symbol insertions and deletions. However, despite …
On Optimal k-Deletion Correcting Codes
Levenshtein introduced the problem of constructing k-deletion correcting codes in 1966,
proved that the optimal redundancy of those codes is O (k log N) for constant k, and …
proved that the optimal redundancy of those codes is O (k log N) for constant k, and …
Coded trace reconstruction
Motivated by average-case trace reconstruction and coding for portable DNA-based storage
systems, we initiate the study of coded trace reconstruction, the design and analysis of high …
systems, we initiate the study of coded trace reconstruction, the design and analysis of high …
Optimal systematic t-deletion correcting codes
Systematic deletion correcting codes play an important role in applications of document
exchange. Yet despite a series of recent advances made in deletion correcting codes, most …
exchange. Yet despite a series of recent advances made in deletion correcting codes, most …
Explicit two-deletion codes with redundancy matching the existential bound
V Guruswami, J Håstad - IEEE Transactions on Information …, 2021 - ieeexplore.ieee.org
We give an explicit construction of length-n binary codes capable of correcting the deletion
of two bits that have size 2 n/n 4+ o (1). This matches up to lower order terms the existential …
of two bits that have size 2 n/n 4+ o (1). This matches up to lower order terms the existential …
Optimal document exchange and new codes for insertions and deletions
B Haeupler - 2019 IEEE 60th Annual Symposium on …, 2019 - ieeexplore.ieee.org
We give the first communication-optimal document exchange protocol. For any n and k<; n
our randomized scheme takes any n-bit file F and computes a Θ (k log n/k)-bit summary from …
our randomized scheme takes any n-bit file F and computes a Θ (k log n/k)-bit summary from …
Beyond single-deletion correcting codes: Substitutions and transpositions
We consider the problem of designing low-redundancy codes in settings where one must
correct deletions in conjunction with substitutions or adjacent transpositions; a combination …
correct deletions in conjunction with substitutions or adjacent transpositions; a combination …
Systematic codes correcting multiple-deletion and multiple-substitution errors
We consider construction of deletion and substitution correcting codes with low redundancy
and efficient encoding/decoding. First, by simplifying the method of Sima et al.(ISIT 2020) …
and efficient encoding/decoding. First, by simplifying the method of Sima et al.(ISIT 2020) …
Optimally resilient codes for list-decoding from insertions and deletions
We give a complete answer to the following basic question:” What is the maximal fraction of
deletions or insertions tolerable by q-ary list-decodable codes with non-vanishing …
deletions or insertions tolerable by q-ary list-decodable codes with non-vanishing …