Abstract
We find a method for constructing DNA codes with single-deletion-correcting capability. We first present an explicit algorithm for the construction of the q-ary single-deletion-correcting codes (abbreviated as SDC codes) using a class of the complementary information set codes (abbreviated as CIS codes), where q is a power of a prime. We then show that the encoding/decoding scheme of the CIS codes with single-deletion-correcting capability has a simple deterministic algorithm. Finally, applying our algorithm to the generated DNA codes with appropriate modification, we obtain the DNA codes with single-deletion-correcting capability. We present some various examples of such DNA codes, and we also obtain some lower bounds on the maximum size of the single-deletion-correcting DNA codes.
| Original language | English |
|---|---|
| Pages (from-to) | 2581-2596 |
| Number of pages | 16 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 88 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2020 Dec 1 |
Bibliographical note
Publisher Copyright:© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics