空域网络中信道与网络编码分离的研究

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI:10.1109/ISIT.2005.1523638

N. Ratnakar, G. Kramer

{"title":"空域网络中信道与网络编码分离的研究","authors":"N. Ratnakar, G. Kramer","doi":"10.1109/ISIT.2005.1523638","DOIUrl":null,"url":null,"abstract":"It is shown that one cannot always layer, or separate, channel and network coding for multicasting in deterministic relay networks with no interference. We call such networks Aref networks. The suboptimality of such layering in Aref networks is in contrast to the optimality of a similar layering in networks of discrete memoryless channels and certain networks of two-way channels","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"215 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"On the separation of channel and network coding in aref networks\",\"authors\":\"N. Ratnakar, G. Kramer\",\"doi\":\"10.1109/ISIT.2005.1523638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that one cannot always layer, or separate, channel and network coding for multicasting in deterministic relay networks with no interference. We call such networks Aref networks. The suboptimality of such layering in Aref networks is in contrast to the optimality of a similar layering in networks of discrete memoryless channels and certain networks of two-way channels\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"215 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523638\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

研究表明，在无干扰的确定性中继网络中，不能总是分层或分离信道和网络编码进行多播。我们称这种网络为Aref网络。Aref网络中这种分层的次优性与离散无记忆信道网络和某些双向信道网络中类似分层的最优性形成对比

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

查看原文本刊更多论文

On the separation of channel and network coding in aref networks

It is shown that one cannot always layer, or separate, channel and network coding for multicasting in deterministic relay networks with no interference. We call such networks Aref networks. The suboptimality of such layering in Aref networks is in contrast to the optimality of a similar layering in networks of discrete memoryless channels and certain networks of two-way channels

求助全文

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

来源期刊

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

自引率

0.00%

发文量