Title :
A Simple Lower Bound for the Capacity of the Deletion Channel
Author :
Mitzenmacher, Michael ; Drinea, Eleni
Author_Institution :
Div. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA
Abstract :
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
Keywords :
binary codes; channel capacity; channel coding; probability; stochastic processes; Poisson-repeat channel; binary channel; insertion-deletion channel capacity; probability; Capacity planning; Channel capacity; Communication system control; Computer errors; Equations; Error correction; Error correction codes; Information theory; Upper bound; Binary deletion channel; channel capacity; insertion and/or deletion channels;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2006.881844
