"A Class of Codes Capable of Correcting Multiple Deletion and Insertion Errors"

A general construction for binary block codes capable of correcting up to $s$ number of deletion and insertion errors is proposed. The construction is based on concatenation of codes with shorter blocks. It will construct an $s$ deletion/insertion correcting code based on a given $\lceil\frac{s}2\rceil$-deletion insertion correcting code.

The size of the codebook is growing exponentially and it is comparable to asymptotic lower bound of Levenshtein.