首页> 外文会议>IEEE Symposium on Computational Intelligence and Games >Every channel with time structure has a capacity sequence
【24h】

Every channel with time structure has a capacity sequence

机译:每个带时间结构的通道都有一个容量序列

获取原文
获取外文期刊封面目录资料

摘要

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日我们在布达佩斯的研讨会上讲授了我在70岁生日年度的CSISZÁR,结果是,对于最大误差概率下的每个AVC悲观能力和乐观容量相等。这强烈激励我们再次思考绩效标准,我们又回到了我们已经召集的是很久以前[1](弱)容量功能(现在的顺序!)。但这一次我们大胆地猜测下面的定理。它的证据是在几小时内完成的。根据这种引人注目的观察,我们现在省略了“弱”这个词,它来自与弱逆转的联系并进行以下内容

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号