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 …
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 …
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 …
Efficient document exchange and error correcting codes with asymmetric information
We study two fundamental problems in communication, Document Exchange (DE) and Error
Correcting Code (ECC). In the first problem, two parties hold two strings, and one party tries …
Correcting Code (ECC). In the first problem, two parties hold two strings, and one party tries …
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 …
Error correction for dna storage
DNA-based storage is an emerging technology that provides high information density and
longevity. Noise and errors are present in almost every stage of the process: writing, storing …
longevity. Noise and errors are present in almost every stage of the process: writing, storing …
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 …
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 …