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 …
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 …
Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing
We introduce fast-decodable indexing schemes for edit distance which can be used to
speed up edit distance computations to near-linear time if one of the strings is indexed by an …
speed up edit distance computations to near-linear time if one of the strings is indexed by an …
Efficient linear and affine codes for correcting insertions/deletions
This paper studies linear and affine error-correcting codes for correcting synchronization
errors such as insertions and deletions. We call such codes linear/affine insdel codes …
errors such as insertions and deletions. We call such codes linear/affine insdel codes …
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 …
On the list decodability of insertions and deletions
T Hayashi, K Yasunaga - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
In this work, we study the problem of list decoding of insertions and deletions. We present a
Johnson-type upper bound on the maximum list size. The bound is meaningful only when …
Johnson-type upper bound on the maximum list size. The bound is meaningful only when …
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 …
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors
Locally Decodable Codes (LDCs) are error-correcting codes $ C:\Sigma^
n\rightarrow\Sigma^ m $ with super-fast decoding algorithms. They are important …
n\rightarrow\Sigma^ m $ with super-fast decoding algorithms. They are important …