Gilbert-Varshamov inspired lower bound on the maximal cardinality of indel and substitution correcting codes
W.J.P. Speé (Student TU Delft)
Jos H. Weber (TU Delft - Discrete Mathematics and Optimization)
More Info
expand_more
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.
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.