从信道码到计算码

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

François Simon

{"title":"从信道码到计算码","authors":"François Simon","doi":"10.1109/ITW.2012.6404688","DOIUrl":null,"url":null,"abstract":"In this paper, it is shown that a computation code exists for a stationary and ̅d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"From channel codes to computation codes\",\"authors\":\"François Simon\",\"doi\":\"10.1109/ITW.2012.6404688\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, it is shown that a computation code exists for a stationary and ̅d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404688\",\"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.6404688","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文证明，如果存在连接完美计算的预期结果和噪声计算的实际结果的“虚拟”信道的信道码，则存在平稳连续噪声计算的计算码。这证明了从有效的信道代码构建有效的计算代码的可能性。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

From channel codes to computation codes

In this paper, it is shown that a computation code exists for a stationary and ̅d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.

求助全文

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

来源期刊

2012 IEEE Information Theory Workshop

自引率

0.00%

发文量

期刊最新文献

To code or not to code: Revisited Aspect of security in the cognitive relay assisted interference channels Achievable rate regions for compound multiple access channel with channel state information Degrees of freedom of MISO broadcast channel with perfect delayed and imperfect current CSIT Superposition coding for linear operator channels over finite fields