广播信道对称延迟容量区域的多面体描述

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI:10.1109/ISIT.2014.6875208

Amir Salimi, Tie Liu, Shuguang Cui

{"title":"广播信道对称延迟容量区域的多面体描述","authors":"Amir Salimi, Tie Liu, Shuguang Cui","doi":"10.1109/ISIT.2014.6875208","DOIUrl":null,"url":null,"abstract":"This paper provides a polyhedral description of the symmetrical latency capacity region of broadcast channels. The converse result is established via the recently proposed generalized cut-set bounds for broadcast networks. The achievability result is proved by considering a “pairwise exchange” scheme and successive encoding.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Polyhedral description of the symmetrical latency capacity region of broadcast channels\",\"authors\":\"Amir Salimi, Tie Liu, Shuguang Cui\",\"doi\":\"10.1109/ISIT.2014.6875208\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper provides a polyhedral description of the symmetrical latency capacity region of broadcast channels. The converse result is established via the recently proposed generalized cut-set bounds for broadcast networks. The achievability result is proved by considering a “pairwise exchange” scheme and successive encoding.\",\"PeriodicalId\":127191,\"journal\":{\"name\":\"2014 IEEE International Symposium on Information Theory\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2014.6875208\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2014.6875208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文给出了广播信道对称延迟容量区域的多面体描述。通过最近提出的广播网络的广义割集边界建立了相反的结果。通过考虑“成对交换”方案和逐次编码，证明了该算法的可实现性。

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

查看原文本刊更多论文

Polyhedral description of the symmetrical latency capacity region of broadcast channels

This paper provides a polyhedral description of the symmetrical latency capacity region of broadcast channels. The converse result is established via the recently proposed generalized cut-set bounds for broadcast networks. The achievability result is proved by considering a “pairwise exchange” scheme and successive encoding.

求助全文

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

来源期刊

2014 IEEE International Symposium on Information Theory

自引率

0.00%

发文量