Novel Bounds on the Capacity of the Binary Deletion Channel

Details Novel Bounds on the Capacity of the Binary Deletion Channel Novel Bounds on the Capacity of the Binary Deletion Channel

2008-10-04

arxiv.org/abs/0810.0785v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory

Scientific paper

We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since some of the proposed bounds involve infinite series, we also introduce provable inequalities that lead to more manageable results. For most values of the deletion probability, these bounds improve the existing ones and significantly narrow the gap with the available lower bounds. Exploiting the same auxiliary processes, we also derive, as a by-product, a couple of very simple lower bounds on the channel capacity, which, for low values of the deletion probability, are almost as good as the best existing lower bounds.

Affiliated with

Also associated with

No associations

Rating

Novel Bounds on the Capacity of the Binary Deletion Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Novel Bounds on the Capacity of the Binary Deletion Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Novel Bounds on the Capacity of the Binary Deletion Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541813