Abstract
Let be the capacity of the binary deletion channel with deletion probability . It was proved by Drinea and Mitzenmacher that, for all , . Fertonani and Duman recently showed that . In this paper, it is proved that exists and is equal to . This result suggests the conjecture that the curve my be convex in the interval . Furthermore, using currently known bounds for , it leads to the upper bound .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.