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

Dario Fertonani, Tolga M. Duman

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

9 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2552-2556
Number of pages5
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/TerritoryKorea, Republic of
CitySeoul
Period6/28/097/3/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Novel bounds on the capacity of binary channels with deletions and substitutions'. Together they form a unique fingerprint.

Cite this