Diggavi, SuhasMitzenmacher, MichaelPfister, Henry D.2012-07-042012-07-042012-07-04200710.1109/ISIT.2007.4557469https://infoscience.epfl.ch/handle/20.500.14299/83537WOS:000257010202005We 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 non-trivial upper bounds for this probabilistic deletion channel.text::conference output::conference proceedings::conference paper