We present simple, polynomial-time encodable and decodable codes which are asymptotically good for channels allowing insertions, deletions and transpositions. As a corollary, they achieve exponential error probability in a stochastic model of insertion-deletion.
The most recent paper on this subject is by Schulman and Zuckerman REF , who present what they describe as "simple, polynomial-time encodable and decodable codes which are asymptotically good for channels allowing insertions, deletions and transpositions".
Asymptotically good codes correcting insertions, deletions, and transpositions
SODA '97
Mathematics Computer Science