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

7 Citations (Scopus)

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 publicationIEEE International Symposium on Information Theory - Proceedings
Pages2552-2556
Number of pages5
DOIs
StatePublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Other

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

Fingerprint

Deletion
Substitution
Substitution reactions
Binary
Channel Model
Identically distributed
Receiver
Lower bound
Upper bound
Partial

ASJC Scopus subject areas

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

Cite this

Fertonani, D., & Duman, T. M. (2009). Novel bounds on the capacity of binary channels with deletions and substitutions. In IEEE International Symposium on Information Theory - Proceedings (pp. 2552-2556). [5206015] https://doi.org/10.1109/ISIT.2009.5206015

Novel bounds on the capacity of binary channels with deletions and substitutions. / Fertonani, Dario; Duman, Tolga M.

IEEE International Symposium on Information Theory - Proceedings. 2009. p. 2552-2556 5206015.

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

Fertonani, D & Duman, TM 2009, Novel bounds on the capacity of binary channels with deletions and substitutions. in IEEE International Symposium on Information Theory - Proceedings., 5206015, pp. 2552-2556, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5206015
Fertonani D, Duman TM. Novel bounds on the capacity of binary channels with deletions and substitutions. In IEEE International Symposium on Information Theory - Proceedings. 2009. p. 2552-2556. 5206015 https://doi.org/10.1109/ISIT.2009.5206015
Fertonani, Dario ; Duman, Tolga M. / Novel bounds on the capacity of binary channels with deletions and substitutions. IEEE International Symposium on Information Theory - Proceedings. 2009. pp. 2552-2556
@inproceedings{f0ba5556ff8a4e299db8634494ff9201,
title = "Novel bounds on the capacity of binary channels with deletions and substitutions",
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.",
author = "Dario Fertonani and Duman, {Tolga M.}",
year = "2009",
doi = "10.1109/ISIT.2009.5206015",
language = "English (US)",
isbn = "9781424443130",
pages = "2552--2556",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

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

AU - Fertonani, Dario

AU - Duman, Tolga M.

PY - 2009

Y1 - 2009

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

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

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

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

U2 - 10.1109/ISIT.2009.5206015

DO - 10.1109/ISIT.2009.5206015

M3 - Conference contribution

SN - 9781424443130

SP - 2552

EP - 2556

BT - IEEE International Symposium on Information Theory - Proceedings

ER -