Title :
Capacity Upper Bounds for the Deletion Channel
Author :
Diggavi, S. ; Mitzenmacher, Michael ; Pfister, H.D.
Author_Institution :
Sch. of Comput. & Commun. Sci., EPFL, Lausanne
Abstract :
We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as d goes to 1. These appear to be the first nontrivial upper bounds for this probabilistic deletion channel.
Keywords :
binary codes; channel capacity; probability; binary deletion channel; channel capacity; fixed probability; i.i.d. channel; probabilistic deletion channel; Capacity planning; Codes; Computational modeling; Costs; Decoding; Error correction; Stochastic processes; Upper bound;
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
DOI :
10.1109/ISIT.2007.4557469
