基于单调链规则的sleep - wolf问题极坐标编码

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2012-07-01 DOI:10.1109/ISIT.2012.6284254

Erdal Arikan Bilkent

{"title":"基于单调链规则的sleep - wolf问题极坐标编码","authors":"Erdal Arikan Bilkent","doi":"10.1109/ISIT.2012.6284254","DOIUrl":null,"url":null,"abstract":"We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions.","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":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":"{\"title\":\"Polar coding for the Slepian-Wolf problem based on monotone chain rules\",\"authors\":\"Erdal Arikan Bilkent\",\"doi\":\"10.1109/ISIT.2012.6284254\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions.\",\"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\":\"2012-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"53\",\"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.2012.6284254\",\"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.2012.6284254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 53

摘要

给出了一种极点编码方案，该方案在无分时的情况下实现了睡眠-狼问题的完全允许速率区域。该方法基于源极化结果，采用单调链式规则展开。

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

查看原文本刊更多论文

Polar coding for the Slepian-Wolf problem based on monotone chain rules

We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions.

求助全文

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

来源期刊

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

自引率

0.00%

发文量