首页> 外文期刊>IEEE Transactions on Information Theory >Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
【24h】

Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach

机译:多消息组播网络类别的强逆定理:Rényi发散方法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the corresponding sets of achievable rate tuples. Our strong converse result implies that for any DM-MMN of these classes, the average error probabilities of any sequence of codes operated at a rate tuple belonging to the exterior of the cut-set bound must tend to one (and are not simply bounded away from zero) as the block length grows. Examples in the classes of DM-MMNs include wireless erasure networks, DM-MMNs consisting of independent discrete memoryless channels (DMCs) as well as single-destination DM-MMNs consisting of independent DMCs with destination feedback. Our elementary proof technique leverages properties of the Rényi divergence.
机译:本文建立了强逆性对某些类别的离散无记忆多消息多播组播网络(DM-MMN)成立,其对应的割集边界很紧,即与对应的可实现速率元组集合一致。我们强烈的相反结果表明,对于这些类别中的任何DM-MMN,以属于割集边界外部的速率元组进行操作的任何代码序列的平均错误概率都必须趋于1(并且不能简单地加以限制) (从零开始)。 DM-MMN类别中的示例包括无线擦除网络,由独立的离散无记忆通道(DMC)组成的DM-MMN以及由具有目标反馈的独立DMC组成的单目的地DM-MMN。我们的基本证明技术利用了Renyny散度的特性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号