Abstract
Recent advances in DNA data storage and racetrack memory have attracted renewed attention towards deletion, insertion and substitution correcting codes. Compared to codes aimed at correcting either substitution errors or deletion and insertion (indel) errors, the understanding of codes that correct combinations of substitution and indel errors lags behind. In this paper, we focus on the maximal size of q-ary t-indel s-substitution correcting codes. In particular, our main contribution is a Gilbert-Varshamov inspired lower bound on this size. Moreover, we study the asymptotic behaviour of this bound.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2023 Symposium on Information Theory and Signal Processing in the Benelux |
| Pages | 24-28 |
| Publication status | Published - May 2023 |
| Event | 2023 Symposium on Information Theory and Signal Processing in the Benelux - Brussels, Belgium Duration: 11 May 2023 → 12 May 2023 Conference number: 43 |
Conference
| Conference | 2023 Symposium on Information Theory and Signal Processing in the Benelux |
|---|---|
| Abbreviated title | SITB 2023 |
| Country/Territory | Belgium |
| City | Brussels |
| Period | 11/05/23 → 12/05/23 |
Fingerprint
Dive into the research topics of 'Gilbert-Varshamov inspired lower bound on the maximal cardinality of indel and substitution correcting codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver