Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Schulman et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: