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.