On the relationship between edge removal and strong converses

Oliver Kosut, Jorg Kliewer

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

3 Citations (Scopus)

Abstract

This paper explores the relationship between two ideas in network information theory: edge removal and strong converses. Edge removal properties state that if an edge of small capacity is removed from a network, the capacity region does not change too much. Strong converses state that, for rates outside the capacity region, the probability of error converges to 1. Various notions of edge removal and strong converse are defined, depending on how edge capacity and residual error probability scale with blocklength, and relations between them are proved. In particular, each class of strong converse implies a specific class of edge removal. The opposite direction is proved for deterministic networks, and some discussion is given for the noisy case.

Original languageEnglish (US)
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1779-1783
Number of pages5
Volume2016-August
ISBN (Electronic)9781509018062
DOIs
StatePublished - Aug 10 2016
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: Jul 10 2016Jul 15 2016

Other

Other2016 IEEE International Symposium on Information Theory, ISIT 2016
CountrySpain
CityBarcelona
Period7/10/167/15/16

Fingerprint

Converse
Information theory
Error Probability
Information Theory
Converge
Imply
Relationships
Class

ASJC Scopus subject areas

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

Cite this

Kosut, O., & Kliewer, J. (2016). On the relationship between edge removal and strong converses. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (Vol. 2016-August, pp. 1779-1783). [7541605] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541605

On the relationship between edge removal and strong converses. / Kosut, Oliver; Kliewer, Jorg.

Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016. p. 1779-1783 7541605.

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

Kosut, O & Kliewer, J 2016, On the relationship between edge removal and strong converses. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. vol. 2016-August, 7541605, Institute of Electrical and Electronics Engineers Inc., pp. 1779-1783, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 7/10/16. https://doi.org/10.1109/ISIT.2016.7541605
Kosut O, Kliewer J. On the relationship between edge removal and strong converses. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1779-1783. 7541605 https://doi.org/10.1109/ISIT.2016.7541605
Kosut, Oliver ; Kliewer, Jorg. / On the relationship between edge removal and strong converses. Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1779-1783
@inproceedings{032fdff6a73043adae084f44f7ec89d4,
title = "On the relationship between edge removal and strong converses",
abstract = "This paper explores the relationship between two ideas in network information theory: edge removal and strong converses. Edge removal properties state that if an edge of small capacity is removed from a network, the capacity region does not change too much. Strong converses state that, for rates outside the capacity region, the probability of error converges to 1. Various notions of edge removal and strong converse are defined, depending on how edge capacity and residual error probability scale with blocklength, and relations between them are proved. In particular, each class of strong converse implies a specific class of edge removal. The opposite direction is proved for deterministic networks, and some discussion is given for the noisy case.",
author = "Oliver Kosut and Jorg Kliewer",
year = "2016",
month = "8",
day = "10",
doi = "10.1109/ISIT.2016.7541605",
language = "English (US)",
volume = "2016-August",
pages = "1779--1783",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - On the relationship between edge removal and strong converses

AU - Kosut, Oliver

AU - Kliewer, Jorg

PY - 2016/8/10

Y1 - 2016/8/10

N2 - This paper explores the relationship between two ideas in network information theory: edge removal and strong converses. Edge removal properties state that if an edge of small capacity is removed from a network, the capacity region does not change too much. Strong converses state that, for rates outside the capacity region, the probability of error converges to 1. Various notions of edge removal and strong converse are defined, depending on how edge capacity and residual error probability scale with blocklength, and relations between them are proved. In particular, each class of strong converse implies a specific class of edge removal. The opposite direction is proved for deterministic networks, and some discussion is given for the noisy case.

AB - This paper explores the relationship between two ideas in network information theory: edge removal and strong converses. Edge removal properties state that if an edge of small capacity is removed from a network, the capacity region does not change too much. Strong converses state that, for rates outside the capacity region, the probability of error converges to 1. Various notions of edge removal and strong converse are defined, depending on how edge capacity and residual error probability scale with blocklength, and relations between them are proved. In particular, each class of strong converse implies a specific class of edge removal. The opposite direction is proved for deterministic networks, and some discussion is given for the noisy case.

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

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

U2 - 10.1109/ISIT.2016.7541605

DO - 10.1109/ISIT.2016.7541605

M3 - Conference contribution

AN - SCOPUS:84985945074

VL - 2016-August

SP - 1779

EP - 1783

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

ER -