Upper bounding the deletion channel capacity by auxiliary memoryless channels

Dario Fertonani, Tolga M. Duman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - 2009 IEEE International Conference on Communications, ICC 2009
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Conference on Communications, ICC 2009 - Dresden, Germany
Duration: Jun 14 2009Jun 18 2009

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

Other2009 IEEE International Conference on Communications, ICC 2009
CountryGermany
CityDresden
Period6/14/096/18/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Upper bounding the deletion channel capacity by auxiliary memoryless channels'. Together they form a unique fingerprint.

  • Cite this

    Fertonani, D., & Duman, T. M. (2009). Upper bounding the deletion channel capacity by auxiliary memoryless channels. In Proceedings - 2009 IEEE International Conference on Communications, ICC 2009 [5199553] (IEEE International Conference on Communications). https://doi.org/10.1109/ICC.2009.5199553