Novel bounds on the capacity of binary channels with deletions and substitutions

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:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 3
Cited 1

Elements of information theory

Elements of 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

Designing efficient codes for synchronization error channels

Proceedings of the Nineteenth International Workshop on Quality of Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present novel bounds on the capacity of binary channels with independent and identically distributed deletions and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as in the system of interest, but the receiver is provided with (partial) genie-aided information on the deletion/substitution process. In the case of the deletion channel, that is, when no substitutions occur, the proposed upper bound improves the existing ones for most values of the deletion probability, while the proposed lower bound does not. On the other hand, when the channel model also includes substitution errors, both proposed bounds improve the existing ones, significantly narrowing the region to which the actual capacity can belong.