{"title":"在并行信道上进行可靠通信的极性编码","authors":"E. Hof, I. Sason, S. Shamai","doi":"10.1109/CIG.2010.5592728","DOIUrl":null,"url":null,"abstract":"A capacity-achieving polar coding scheme is introduced for reliable communications over a set of parallel communication channels. They are assumed to be arbitrarily-permuted memoryless binary-input and output-symmetric (MBIOS) channels, and they form a set of (stochastically) degraded channels. The general case where the parallel channels are not necessarily degraded is addressed in the full paper version [3], though the suggested scheme is not capacity-achieving in the general case.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"232 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Polar coding for reliable communications over parallel channels\",\"authors\":\"E. Hof, I. Sason, S. Shamai\",\"doi\":\"10.1109/CIG.2010.5592728\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A capacity-achieving polar coding scheme is introduced for reliable communications over a set of parallel communication channels. They are assumed to be arbitrarily-permuted memoryless binary-input and output-symmetric (MBIOS) channels, and they form a set of (stochastically) degraded channels. The general case where the parallel channels are not necessarily degraded is addressed in the full paper version [3], though the suggested scheme is not capacity-achieving in the general case.\",\"PeriodicalId\":354925,\"journal\":{\"name\":\"2010 IEEE Information Theory Workshop\",\"volume\":\"232 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2010.5592728\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592728","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Polar coding for reliable communications over parallel channels
A capacity-achieving polar coding scheme is introduced for reliable communications over a set of parallel communication channels. They are assumed to be arbitrarily-permuted memoryless binary-input and output-symmetric (MBIOS) channels, and they form a set of (stochastically) degraded channels. The general case where the parallel channels are not necessarily degraded is addressed in the full paper version [3], though the suggested scheme is not capacity-achieving in the general case.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
