{"title":"信道编码与睡眠狼编码之间的线性编码对偶性","authors":"Lele Wang, Young-Han Kim","doi":"10.1109/ALLERTON.2015.7446997","DOIUrl":null,"url":null,"abstract":"We study the duality between channel coding and Slepian-Wolf coding in the linear coding framework. We show how a code (both its encoder and decoder) for a symmetric channel coding problem can be used to design a code for a general Slepian-Wolf problem. Conversely, we show how a code for a symmetric Slepian-Wolf problem can be used to design a code for a general channel coding problem. The exact relations between the rates and the probability of errors of the two codes are established.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Linear code duality between channel coding and Slepian-Wolf coding\",\"authors\":\"Lele Wang, Young-Han Kim\",\"doi\":\"10.1109/ALLERTON.2015.7446997\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the duality between channel coding and Slepian-Wolf coding in the linear coding framework. We show how a code (both its encoder and decoder) for a symmetric channel coding problem can be used to design a code for a general Slepian-Wolf problem. Conversely, we show how a code for a symmetric Slepian-Wolf problem can be used to design a code for a general channel coding problem. The exact relations between the rates and the probability of errors of the two codes are established.\",\"PeriodicalId\":112948,\"journal\":{\"name\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2015.7446997\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7446997","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Linear code duality between channel coding and Slepian-Wolf coding
We study the duality between channel coding and Slepian-Wolf coding in the linear coding framework. We show how a code (both its encoder and decoder) for a symmetric channel coding problem can be used to design a code for a general Slepian-Wolf problem. Conversely, we show how a code for a symmetric Slepian-Wolf problem can be used to design a code for a general channel coding problem. The exact relations between the rates and the probability of errors of the two codes are established.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
