组合联合信信道编码的结果

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI:10.1109/ITW.2012.6404637

Y. Kochman, A. Mazumdar, Yury Polyanskiy

{"title":"组合联合信信道编码的结果","authors":"Y. Kochman, A. Mazumdar, Yury Polyanskiy","doi":"10.1109/ITW.2012.6404637","DOIUrl":null,"url":null,"abstract":"This paper continues the investigation of the combinatorial formulation of the joint source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem is proposed and some initial results are put forward.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Results on combinatorial joint source-channel coding\",\"authors\":\"Y. Kochman, A. Mazumdar, Yury Polyanskiy\",\"doi\":\"10.1109/ITW.2012.6404637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper continues the investigation of the combinatorial formulation of the joint source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem is proposed and some initial results are put forward.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404637\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

本文继续研究联合信源信道编码问题的组合形式。特别是，这些连接被绘制到减少错误的代码、等距嵌入和列表可解码的代码。推导了重复构造的最佳性能，并证明了低复杂度马尔可夫解码器可以实现。提出了该问题的复合变分，并给出了一些初步结果。

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

查看原文本刊更多论文

Results on combinatorial joint source-channel coding

This paper continues the investigation of the combinatorial formulation of the joint source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem is proposed and some initial results are put forward.

求助全文

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

来源期刊

2012 IEEE Information Theory Workshop

自引率

0.00%

发文量