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 …
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 …
Capacity upper bounds for deletion-type channels
M Cheraghchi - Journal of the ACM (JACM), 2019 - dl.acm.org
We develop a systematic approach, based on convex programming and real analysis for
obtaining upper bounds on the capacity of the binary deletion channel and, more generally …
obtaining upper bounds on the capacity of the binary deletion channel and, more generally …
Guess & check codes for deletions, insertions, and synchronization
SK Hanna, S El Rouayheb - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
We consider the problem of constructing codes that can correct δ deletions occurring in an
arbitrary binary string of length n bits. Varshamov-Tenengolts (VT) codes, dating back to …
arbitrary binary string of length n bits. Varshamov-Tenengolts (VT) codes, dating back to …
The zero-rate threshold for adversarial bit-deletions is less than 1/2
We prove that there exists an absolute constant such that any binary code tolerating
adversarial deletions must satisfy and thus have rate asymptotically approaching 0. This is …
adversarial deletions must satisfy and thus have rate asymptotically approaching 0. This is …
Polar coding for deletion channels: Theory and implementation
In this paper, we propose a polar coding scheme for binary deletion channels. We also
present an implementation of low-complexity polar SC decoder for deletion channels. The …
present an implementation of low-complexity polar SC decoder for deletion channels. The …
Polynomial time decodable codes for the binary deletion channel
V Guruswami, R Li - IEEE Transactions on Information Theory, 2018 - ieeexplore.ieee.org
In the random deletion channel, each bit is deleted independently with probability p. For the
random deletion channel, the existence of codes of rate (1-p)/9, and thus bounded away …
random deletion channel, the existence of codes of rate (1-p)/9, and thus bounded away …
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 …
Polar coding for channels with deletions
K Tian, A Fazeli, A Vardy - IEEE Transactions on Information …, 2021 - ieeexplore.ieee.org
Deletion errors are notoriously difficult to correct. The capacity of the binary deletion channel
is not yet fully known, and there is no completely satisfactory solution even to the specific …
is not yet fully known, and there is no completely satisfactory solution even to the specific …