{"title":"固定分组方案:信道和源编码之间的操作对偶性问题与侧信息","authors":"Hua Wang, P. Viswanath","doi":"10.1109/ISIT.2004.1365231","DOIUrl":null,"url":null,"abstract":"In this paper, the meaning of duality in terms of the coding operations and the corresponding performance measures are examined. In this paper, operational duality to the channel and source coding problems with side information are extended. A class of deterministic maximal binning schemes is constructed. Each bin corresponds to a maximal channel code and the collection of the codewords in all the bins forms a maximal channel code. The construction of the binning scheme from the individual channel codes is greedy and provides an alternative proof of the coding theorem for the two side information problems.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Fixed binning schemes: an operational duality between channel and source coding problems with side information\",\"authors\":\"Hua Wang, P. Viswanath\",\"doi\":\"10.1109/ISIT.2004.1365231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the meaning of duality in terms of the coding operations and the corresponding performance measures are examined. In this paper, operational duality to the channel and source coding problems with side information are extended. A class of deterministic maximal binning schemes is constructed. Each bin corresponds to a maximal channel code and the collection of the codewords in all the bins forms a maximal channel code. The construction of the binning scheme from the individual channel codes is greedy and provides an alternative proof of the coding theorem for the two side information problems.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365231\",\"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 onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fixed binning schemes: an operational duality between channel and source coding problems with side information
In this paper, the meaning of duality in terms of the coding operations and the corresponding performance measures are examined. In this paper, operational duality to the channel and source coding problems with side information are extended. A class of deterministic maximal binning schemes is constructed. Each bin corresponds to a maximal channel code and the collection of the codewords in all the bins forms a maximal channel code. The construction of the binning scheme from the individual channel codes is greedy and provides an alternative proof of the coding theorem for the two side information problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
