Every channel with time structure has a capacity sequence

R. Ahlswede
{"title":"Every channel with time structure has a capacity sequence","authors":"R. Ahlswede","doi":"10.1109/CIG.2010.5592902","DOIUrl":null,"url":null,"abstract":"On August 25th 2008 we lectured at the workshop in Budapest which honored I. Csiszár in the year of his 70th birthday, on the result that for every AVC under maximal error probability pessimistic capacity and optimistic capacity are equal. This strongly motivated us to think again about performance criteria and we came back to what we called already a long time ago [1] a (weak) capacity function (now sequence!). But this time we were bold enough to conjecture the theorem below. Its proof was done in hours. In the light of this striking observation we omit now the word “weak” which came from the connection with the weak converse and make the following","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592902","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

On August 25th 2008 we lectured at the workshop in Budapest which honored I. Csiszár in the year of his 70th birthday, on the result that for every AVC under maximal error probability pessimistic capacity and optimistic capacity are equal. This strongly motivated us to think again about performance criteria and we came back to what we called already a long time ago [1] a (weak) capacity function (now sequence!). But this time we were bold enough to conjecture the theorem below. Its proof was done in hours. In the light of this striking observation we omit now the word “weak” which came from the connection with the weak converse and make the following
每一个有时间结构的信道都有一个容量序列
2008年8月25日,我们在布达佩斯举办的纪念I. Csiszár 70岁生日的研讨会上发表了演讲,讨论了在最大误差概率下,每个AVC的悲观能力和乐观能力是相等的。这强烈地促使我们再次思考性能标准,我们回到了很久以前[1]所说的(弱)容量函数(现在是序列!)。但这次我们大胆地推测了下面的定理。它的证明只用了几个小时。根据这一惊人的观察,我们现在省略了“弱”这个词,它来自于与弱反义词的联系,并做出如下表述
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信