A new bound on the capacity of the binary deletion channel with high deletion probabilities

Let C(d) be the capacity of the binary deletion channel with deletion probability d. It was proved by Drinea and Mitzenmacher that, for all d, C(d)/(1 − d) ≥ 0.1185. Fertonani and Duman recently showed that lim sup<inf>d→1</inf> C(d)/(1−d) ≤ 0.49. In this paper, it is proved that lim<inf>d→1</inf> C(d)/(1 − d) exists and is equal to inf<inf>d</inf> C(d)/(1−d). This result suggests the conjecture that the curve C(d) my be convex in the interval d ∈ [0, 1]. Furthermore, using currently known bounds for C(d), it leads to the upper bound lim<inf>d→1</inf> C(d)/(1 − d) ≤ 0.4143.

[1]  Suhas N. Diggavi,et al.  On information transmission over a finite buffer channel , 2000, IEEE Transactions on Information Theory.

[2]  Adam Tauman Kalai,et al.  Tight asymptotic bounds for the deletion channel with small deletion probabilities , 2010, 2010 IEEE International Symposium on Information Theory.

[3]  Dario Fertonani,et al.  Novel Bounds on the Capacity of the Binary Deletion Channel , 2010, IEEE Transactions on Information Theory.

[4]  G. Pólya,et al.  Problems and theorems in analysis , 1983 .

[5]  Michael Mitzenmacher,et al.  Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels , 2007, IEEE Transactions on Information Theory.

[6]  Michael Mitzenmacher,et al.  A Simple Lower Bound for the Capacity of the Deletion Channel , 2006, IEEE Transactions on Information Theory.

[7]  Yashodhan Kanoria,et al.  On the deletion channel with small deletion probability , 2009, 2010 IEEE International Symposium on Information Theory.