The ρ-capacity of a graph

Sihuang Hu, Ofer Shayevitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Motivated by the problem of zero-error broadcasting, we introduce a new notion of graph capacity, termed ρ-capacity, that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on the ρ-capacity of arbitrary graphs, and provide a tighter upper bound for regular graphs. The ρ-capacity is employed to characterize the zero-error capacity region of the degraded broadcast channel.

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

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August

Conference

Conference2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/TerritorySpain
CityBarcelona
Period10/07/1615/07/16

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'The ρ-capacity of a graph'. Together they form a unique fingerprint.

Cite this