Novel bounds on the capacity of the binary deletion channel

Authors:
Dario Fertonani;Tolga M. Duman
Affiliations:
Qualcomm Inc., San Diego, CA and School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ;School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 4
Cited 2

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
A Simple Lower Bound for the Capacity of the Deletion Channel

IEEE Transactions on Information Theory
Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels

IEEE Transactions on Information Theory
Capacity Bounds for Sticky Channels

IEEE Transactions on Information Theory

Upper bounding the deletion channel capacity by auxiliary memoryless channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs

IEEE Transactions on Communications

Quantified Score

Hi-index	754.84

Visualization

Abstract

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.