Gilbert-Varshamov inspired lower bound on the maximal cardinality of indel and substitution correcting codes

Speé, W.J.P.; Weber, J.H.

Gilbert-Varshamov inspired lower bound on the maximal cardinality of indel and substitution correcting codes

Conference paper (2023)

Authors

W.J.P. Speé Student

J.H. Weber Discrete Mathematics and Optimization

Research Group

Discrete Mathematics and Optimization

To reference this document use:

http://resolver.tudelft.nl/uuid:3b275cb5-45ab-46da-a675-c20a4aa9518f

More Info

expand_more

Published Date

2023-5

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Discrete Mathematics and Optimization

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.

Files

Paper_SITB_2023_Ward_Spee_and_... (pdf)

(pdf | 0.339 Mb)

License info not available