Codes for correcting three or more adjacent deletions or insertions

Ling Cheng, Theo G. Swart, Hendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar
2014 2014 IEEE International Symposium on Information Theory  
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.
doi:10.1109/isit.2014.6875032 dblp:conf/isit/ChengSFA14 fatcat:i4tvtxpecjdi7mwoau4m5csrq4