Name
Abstract | ||
|---|---|---|
Correcting insertions/deletions as well as substitution errors simultaneously plays an important role in DNA-based storage systems as well as in classical communications. This paper deals with the fundamental task of constructing codes that can correct a single insertion or deletion along with a single substitution. A non-asymptotic upper bound on the size of singledeletion single-substitution correcting codes is derived, showing that the redundancy of such a code of length n has to be at least 2 log n. The bound is presented both for binary and non-binary codes while an extension to single deletion and multiple substitutions is presented for binary codes. An explicit construction of single-deletion single-substitution correcting codes with at most 6 log n + 8 redundancy bits is derived. Note that the best known construction for this problem has to use 3-deletion correcting codes whose best known redundancy is roughly 24 log n. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ISIT44484.2020.9174213 | ISIT |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Smagloy Ilia | 1 | 0 | 0.34 |
| Welter Lorenz | 2 | 0 | 0.34 |
| Antonia Wachter-Zeh | 3 | 129 | 33.65 |
| Eitan Yaakobi | 4 | 604 | 70.41 |