A simple lower bound for the capacity of the deletion channel
We present a simple proof that the capacity of the binary independent and identically distributed (i.i.d.) deletion channel, where each bit is deleted independently with probability d, is at least (1 - d)/9, by developing a correspondence between the deletion channel and an insertion/deletion channel that we call a Poisson-repeat channel.
binary deletion channel channel capacity insertion and/or deletion channels