图的ρ容量

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2016-08-11 DOI:10.1109/ISIT.2016.7541770

Sihuang Hu, O. Shayevitz

{"title":"图的ρ容量","authors":"Sihuang Hu, O. Shayevitz","doi":"10.1109/ISIT.2016.7541770","DOIUrl":null,"url":null,"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.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The ρ-capacity of a graph\",\"authors\":\"Sihuang Hu, O. Shayevitz\",\"doi\":\"10.1109/ISIT.2016.7541770\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":92224,\"journal\":{\"name\":\"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2016.7541770\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在零错误广播问题的启发下，我们引入了一个新的图容量概念，称为ρ-容量，它推广了图的香农容量。我们给出了任意图的ρ容量的上界和下界，并给出了正则图的一个更紧的上界。采用ρ-capacity来表征退化广播信道的零误差容量区域。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The ρ-capacity of a graph

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications

自引率

0.00%

发文量