Upper bounding the deletion channel capacity by auxiliary memoryless channels

Authors:
Dario Fertonani;Tolga M. Duman
Affiliations:
Department of Electrical Engineering, Arizona State University, Tempe, AZ;Department of Electrical Engineering, Arizona State University, Tempe, AZ
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 3
Cited 0

Elements of information theory

Elements of information theory
Novel bounds on the capacity of the binary 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two upper bounds on the capacity of the binary deletion channel. Both bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since the closed-form expressions 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.