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 …
Information-theoretic foundations of DNA data storage
I Shomorony, R Heckel - Foundations and Trends® in …, 2022 - nowpublishers.com
Due to its longevity and enormous information density, DNA is an attractive medium for
archival data storage. Natural DNA more than 700.000 years old has been recovered, and …
archival data storage. Natural DNA more than 700.000 years old has been recovered, and …
Survey for a Decade of Coding for DNA Storage
Advancements in DNA synthesis and sequencing technologies have enabled the storage of
data on synthetic DNA strands. However, realizing its potential relies on the design of …
data on synthetic DNA strands. However, realizing its potential relies on the design of …
Bounds and constructions for insertion and deletion codes
Insertion and deletion (insdel for short) codes have recently attracted a lot of attention due to
their applications in many interesting fields such as DNA storage, DNA analysis, race-track …
their applications in many interesting fields such as DNA storage, DNA analysis, race-track …
Reed Solomon codes against adversarial insertions and deletions
In this work, we study the performance of Reed–Solomon codes against adversarial
insertion-deletion (insdel) errors. We prove that over fields of size there are Reed-Solomon …
insertion-deletion (insdel) errors. We prove that over fields of size there are Reed-Solomon …
Insdel codes from subspace and rank-metric codes
V Aggarwal, R Pratihar - Discrete Mathematics, 2024 - Elsevier
Insertion and deletion (insdel in short) codes are designed to deal with synchronization
errors in communication channels caused by insertions and deletions of message symbols …
errors in communication channels caused by insertions and deletions of message symbols …
Locally decodable/correctable codes for insertions and deletions
Recent efforts in coding theory have focused on building codes for insertions and deletions,
called insdel codes, with optimal trade-offs between their redundancy and their error …
called insdel codes, with optimal trade-offs between their redundancy and their error …
Exponential lower bounds for locally decodable and correctable codes for insertions and deletions
Locally Decodable Codes (LDCs) are error-correcting codes for which individual message
symbols can be quickly recovered despite errors in the codeword. LDCs for Hamming errors …
symbols can be quickly recovered despite errors in the codeword. LDCs for Hamming errors …
Private and resource-bounded locally decodable codes for insertions and deletions
We construct locally decodable codes (LDCs) to correct insertion-deletion errors in the
setting where the sender and receiver share a secret key or where the channel is resource …
setting where the sender and receiver share a secret key or where the channel is resource …
Linear insertion deletion codes in the high-noise and high-rate regimes
This work continues the study of linear error correcting codes against adversarial insertion
deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and …
deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and …