2021
DOI: 10.1109/tit.2021.3056317
|View full text |Cite
|
Sign up to set email alerts
|

Synchronization Strings and Codes for Insertions and Deletions—A Survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 37 publications
(38 citation statements)
references
References 53 publications
0
33
0
Order By: Relevance
“…Also, 1 − p is a trivial upper bound on the possible rate, even for the simpler model of p fraction of erasures. Explicit constructions of p-deletion correcting of rate approaching 1 − p over an alphabet size independent of N were given in [HS18] based on synchronization strings, which is a very elegant tool that has since found several other applications (see the survey [HS21]).…”
Section: Deletion Correction In Related Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…Also, 1 − p is a trivial upper bound on the possible rate, even for the simpler model of p fraction of erasures. Explicit constructions of p-deletion correcting of rate approaching 1 − p over an alphabet size independent of N were given in [HS18] based on synchronization strings, which is a very elegant tool that has since found several other applications (see the survey [HS21]).…”
Section: Deletion Correction In Related Modelsmentioning
confidence: 99%
“…This tantalizing question was implicit in early works on deletion codes, particularly in [Ull67], which gave bounds on the achievable tradeoffs between rate and deletion fraction, and was explicitly raised in [KMTU11]. Since then, this question has been mentioned in several works, including the work of Bukh and Ma [BM14] which showed that an upper bound of 1 2 − 1 poly log N on the correctable deletion fraction, and many recent works on deletion code constructions such as [Wan15, GL16, GW17, BGH17, GL20, GHS20], other works on coding theory [ZBJ20], as well as the recent surveys [CR21,HS21]. In the other direction, the best known lower bound p thr del > √ 2 − 1 is due to [BGH17], who constructed explicit binary codes of non-vanishing rate to correct a fraction of deletions approaching √ 2 − 1 (see [SZ99,KMTU11] for prior constructions).…”
Section: 9 Conclusion and Open Questions 1 Introductionmentioning
confidence: 99%
“…Proof. By Theorem 3.11, it is sufficient to verify that the inequality (12) holds assuming that the inequality (15) holds. Indeed (12) holds under our assumption since…”
Section: 3mentioning
confidence: 99%
“…Afterwards, various aspects of insdel codes such as bounds, constructions and decoding algorithms have been studied in literatures (see [23,2,20,31,24,27,1,3,12]).…”
Section: Introductionmentioning
confidence: 99%
“…deletions is fundamental for the design of reliable DNA-based data storage systems with nanoporebased sequencing [11,12,13]. Second, understanding the structure of the mean trace of a string is by itself a natural information-theoretic problem which may lead to improved capacity bounds and coding techniques for channels with synchronization errors, both notoriously difficult problems (see the extensive surveys [14,15,7,16]).…”
Section: Introductionmentioning
confidence: 99%