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.


Published in:
2007 Ieee International Symposium On Information Theory Proceedings, Vols 1-7, 1716-1720
Presented at:
IEEE International Symposium on Information Theory, Nice, FRANCE, Jun 24-29, 2007
Year:
2007
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-1397-3
Laboratories:




 Record created 2012-07-04, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)