A new bound for the capacity of the deletion channel with high deletion probabilities

preprint2012arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.