Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size

This article studies the cardinality of perfect multi deletion binary codes. The lower bound for any perfect deletion code with fixed code length and number of deletions, and the asymptotic achievability of Levenshtein's upper bound are shown.