Novel Bounds on the Capacity of the Binary Deletion Channel

DOI10.1109/TIT.2010.2046210MaRDI QIDQ5281449zbMATH OpenFDO

Authors Dario Fertonani, Tolga M. Duman

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0810.0785

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

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

Cited in

(4)

• Polynomial Time Decodable Codes for the Binary Deletion Channel
• Capacity Upper Bounds for Deletion-type Channels
• Optimal Coding for the Binary Deletion Channel With Small Deletion Probability
• On the decoding error weight of one or two deletion channels

This page was built for publication: Novel Bounds on the Capacity of the Binary Deletion Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281449)