Novel bounds on the capacity of the binary deletion channel

Dario Fertonani, Tolga M. Duman

Research output: Contribution to journalArticle

35 Citations (Scopus)

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.

Original languageEnglish (US)
Article number2046210
Pages (from-to)2753-2765
Number of pages13
JournalIEEE Transactions on Information Theory
Volume56
Issue number6
DOIs
StatePublished - Jun 2010

Fingerprint

Channel capacity
Random processes
Byproducts
Transmitters
recipient
Values

Keywords

  • Binary deletion channel
  • Capacity bounds
  • Channel capacity

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Novel bounds on the capacity of the binary deletion channel. / Fertonani, Dario; Duman, Tolga M.

In: IEEE Transactions on Information Theory, Vol. 56, No. 6, 2046210, 06.2010, p. 2753-2765.

Research output: Contribution to journalArticle

Fertonani, Dario ; Duman, Tolga M. / Novel bounds on the capacity of the binary deletion channel. In: IEEE Transactions on Information Theory. 2010 ; Vol. 56, No. 6. pp. 2753-2765.
@article{4b72ea49a36f4d04a31e3c78230f3c1f,
title = "Novel bounds on the capacity of the binary deletion channel",
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.",
keywords = "Binary deletion channel, Capacity bounds, Channel capacity",
author = "Dario Fertonani and Duman, {Tolga M.}",
year = "2010",
month = "6",
doi = "10.1109/TIT.2010.2046210",
language = "English (US)",
volume = "56",
pages = "2753--2765",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Novel bounds on the capacity of the binary deletion channel

AU - Fertonani, Dario

AU - Duman, Tolga M.

PY - 2010/6

Y1 - 2010/6

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

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

KW - Binary deletion channel

KW - Capacity bounds

KW - Channel capacity

UR - http://www.scopus.com/inward/record.url?scp=77955702604&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955702604&partnerID=8YFLogxK

U2 - 10.1109/TIT.2010.2046210

DO - 10.1109/TIT.2010.2046210

M3 - Article

VL - 56

SP - 2753

EP - 2765

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

M1 - 2046210

ER -