Conference paper

Capacity upper bounds for the deletion channel

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 non-trivial upper bounds for this probabilistic deletion channel.


  • There is no available fulltext. Please contact the lab or the authors.

Related material