Novel Bounds on the Capacity of the Binary Deletion Channel

作者：Fertonani Dario^*; Duman Tolga M

来源：IEEE Transactions on Information Theory, 2010, 56(6): 2753-2765.

DOI：10.1109/TIT.2010.2046210

• Binary deletion channel
• capacity bounds
• channel capacity

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, two 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.

• 出版日期2010-6