An upper bound on the capacity of non-binary deletion channels

Mojtaba Rahmati, Tolga M. Duman

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

2 Citations (Scopus)

Abstract

We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such studies for the non-binary case are largely missing. The state of the art is the following: as a trivial upper bound, capacity of an erasure channel with the same input alphabet as the deletion channel can be used, and as a lower bound the results by Diggavi and Grossglauser in [1] are available. In this paper, we derive the first non-trivial non-binary deletion channel capacity upper bound and reduce the gap with the existing achievable rates. To derive the results we first prove an inequality between the capacity of a 2K-ary deletion channel with deletion probability d, denoted by C2K(d), and the capacity of the binary deletion channel with the same deletion probability, C2(d), that is, C2K(d) ≤ C2(d)+(1-d) log(K). Then by employing some existing upper bounds on the capacity of the binary deletion channel, we obtain upper bounds on the capacity of the 2K-ary deletion channel. We illustrate via examples the use of the new bounds and discuss their asymptotic behavior as d → 0.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2940-2944
Number of pages5
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

Fingerprint

Deletion
Upper bound
Channel capacity
Binary
Channel Capacity
Upper and Lower Bounds
Trivial
Asymptotic Behavior
Lower bound

ASJC Scopus subject areas

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

Cite this

Rahmati, M., & Duman, T. M. (2013). An upper bound on the capacity of non-binary deletion channels. In IEEE International Symposium on Information Theory - Proceedings (pp. 2940-2944). [6620764] https://doi.org/10.1109/ISIT.2013.6620764

An upper bound on the capacity of non-binary deletion channels. / Rahmati, Mojtaba; Duman, Tolga M.

IEEE International Symposium on Information Theory - Proceedings. 2013. p. 2940-2944 6620764.

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

Rahmati, M & Duman, TM 2013, An upper bound on the capacity of non-binary deletion channels. in IEEE International Symposium on Information Theory - Proceedings., 6620764, pp. 2940-2944, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620764
Rahmati M, Duman TM. An upper bound on the capacity of non-binary deletion channels. In IEEE International Symposium on Information Theory - Proceedings. 2013. p. 2940-2944. 6620764 https://doi.org/10.1109/ISIT.2013.6620764
Rahmati, Mojtaba ; Duman, Tolga M. / An upper bound on the capacity of non-binary deletion channels. IEEE International Symposium on Information Theory - Proceedings. 2013. pp. 2940-2944
@inproceedings{dc6782ef2df74adfad84116a42b3d462,
title = "An upper bound on the capacity of non-binary deletion channels",
abstract = "We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such studies for the non-binary case are largely missing. The state of the art is the following: as a trivial upper bound, capacity of an erasure channel with the same input alphabet as the deletion channel can be used, and as a lower bound the results by Diggavi and Grossglauser in [1] are available. In this paper, we derive the first non-trivial non-binary deletion channel capacity upper bound and reduce the gap with the existing achievable rates. To derive the results we first prove an inequality between the capacity of a 2K-ary deletion channel with deletion probability d, denoted by C2K(d), and the capacity of the binary deletion channel with the same deletion probability, C2(d), that is, C2K(d) ≤ C2(d)+(1-d) log(K). Then by employing some existing upper bounds on the capacity of the binary deletion channel, we obtain upper bounds on the capacity of the 2K-ary deletion channel. We illustrate via examples the use of the new bounds and discuss their asymptotic behavior as d → 0.",
author = "Mojtaba Rahmati and Duman, {Tolga M.}",
year = "2013",
doi = "10.1109/ISIT.2013.6620764",
language = "English (US)",
isbn = "9781479904464",
pages = "2940--2944",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - An upper bound on the capacity of non-binary deletion channels

AU - Rahmati, Mojtaba

AU - Duman, Tolga M.

PY - 2013

Y1 - 2013

N2 - We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such studies for the non-binary case are largely missing. The state of the art is the following: as a trivial upper bound, capacity of an erasure channel with the same input alphabet as the deletion channel can be used, and as a lower bound the results by Diggavi and Grossglauser in [1] are available. In this paper, we derive the first non-trivial non-binary deletion channel capacity upper bound and reduce the gap with the existing achievable rates. To derive the results we first prove an inequality between the capacity of a 2K-ary deletion channel with deletion probability d, denoted by C2K(d), and the capacity of the binary deletion channel with the same deletion probability, C2(d), that is, C2K(d) ≤ C2(d)+(1-d) log(K). Then by employing some existing upper bounds on the capacity of the binary deletion channel, we obtain upper bounds on the capacity of the 2K-ary deletion channel. We illustrate via examples the use of the new bounds and discuss their asymptotic behavior as d → 0.

AB - We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such studies for the non-binary case are largely missing. The state of the art is the following: as a trivial upper bound, capacity of an erasure channel with the same input alphabet as the deletion channel can be used, and as a lower bound the results by Diggavi and Grossglauser in [1] are available. In this paper, we derive the first non-trivial non-binary deletion channel capacity upper bound and reduce the gap with the existing achievable rates. To derive the results we first prove an inequality between the capacity of a 2K-ary deletion channel with deletion probability d, denoted by C2K(d), and the capacity of the binary deletion channel with the same deletion probability, C2(d), that is, C2K(d) ≤ C2(d)+(1-d) log(K). Then by employing some existing upper bounds on the capacity of the binary deletion channel, we obtain upper bounds on the capacity of the 2K-ary deletion channel. We illustrate via examples the use of the new bounds and discuss their asymptotic behavior as d → 0.

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

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

U2 - 10.1109/ISIT.2013.6620764

DO - 10.1109/ISIT.2013.6620764

M3 - Conference contribution

AN - SCOPUS:84890405553

SN - 9781479904464

SP - 2940

EP - 2944

BT - IEEE International Symposium on Information Theory - Proceedings

ER -