单服务信道容量

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI:10.1109/ISIT.2006.262081

R. Renner, S. Wolf, Jürg Wullschleger

{"title":"单服务信道容量","authors":"R. Renner, S. Wolf, Jürg Wullschleger","doi":"10.1109/ISIT.2006.262081","DOIUrl":null,"url":null,"abstract":"In this paper we provide the answer to the following question: given a noisy channel PY|X and epsi > 0, how many bits can be transmitted with an error of at most epsi by a single use of the channel","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"175 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"The Single-Serving Channel Capacity\",\"authors\":\"R. Renner, S. Wolf, Jürg Wullschleger\",\"doi\":\"10.1109/ISIT.2006.262081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we provide the answer to the following question: given a noisy channel PY|X and epsi > 0, how many bits can be transmitted with an error of at most epsi by a single use of the channel\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"175 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.262081\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.262081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 30

摘要

本文给出了以下问题的答案:给定一个有噪声的信道PY|X，且epsi > 0，单次使用该信道可以以最多epsi的误差传输多少位

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

查看原文

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

本刊更多论文

The Single-Serving Channel Capacity

In this paper we provide the answer to the following question: given a noisy channel PY|X and epsi > 0, how many bits can be transmitted with an error of at most epsi by a single use of the channel

求助全文

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

来源期刊

2006 IEEE International Symposium on Information Theory

自引率

0.00%

发文量