{"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}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
