Abstract
Codes are presented that can correct the deletion or
the insertion of a predetermined number of adjacent bits greater
than or equal to three. This extends the constructions of codes
beyond those proposed by Levenshtein fifty years ago to correct
one or two adjacent deletions or insertions.