Published July 2021
| public
Book Section - Chapter
Non-binary Codes for Correcting a Burst of at Most 2 Deletions
Abstract
The problem of correcting deletions has recently received significantly increased attention, partly because of the prevalence of these errors in DNA data storage. In this paper, we study the problem of correcting a burst of at most two deletions in non-binary sequences. The problem was first studied for binary sequences by Levenshtein, who presented a construction with optimal redundancy. We propose a non-binary code correcting a burst of at most 2 deletions for q-ary alphabets with redundancy log n+O (log q log log n) bits, for even q. Further, we construct codes with lower redundancy to correct a burst of exactly 2 deletions caused by a single deletion in alternating sequences that arise in terminator-free enzymatic DNA synthesis.
Additional Information
© 2021 IEEE.Additional details
- Eprint ID
- 111802
- DOI
- 10.1109/isit45174.2021.9517917
- Resolver ID
- CaltechAUTHORS:20211109-212433973
- Created
-
2021-11-11Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field