Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size
arXiv:1910.06740
Abstract
This paper studies on the cardinality of perfect multi deletion binary codes. The lower bound for any perfect deletion code with the fixed code length and the number of deletions, and the asymptotic achievable of Levenshtein's upper bound are shown.
17 pages, no figures, no conference presentation