...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Achievability Proof via Output Statistics of Random Binning
【24h】

Achievability Proof via Output Statistics of Random Binning

机译：通过随机装箱的输出统计来证明可实现性

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper’s observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one to add an eavesdropper and obtain a result on the secrecy rates for free. We make a case for generality of the framework by studying examples in a variety of settings including channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback, and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to the hybrid coding scheme. In addition, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish achievability results for coordination problems, including interactive channel simulation, coordination via relay and channel simulation via another channel.
机译：本文介绍了一个新的无处不在的框架，用于建立网络信息理论问题中的可实现性结果。该框架使用随机合并参数，并且基于通道和源编码问题之间的对偶。此外，该框架使用pmf近似参数代替计数和典型性。这就证明了协调性和强烈的保密性问题，其中需要满足有关随机变量分布的某些统计条件。这些统计条件包括：邮件和窃听者对保密问题的观察之间的独立性，以及协调问题中与某种分布（通常为i.d.分布）的接近程度。该框架的一个重要功能是使人们能够免费添加窃听程序并获得保密率的结果。我们通过研究各种设置中的示例（包括通道编码，有损源编码，联合源通道编码，协调，强保密性，反馈和中继）来说明框架的一般性。特别地，通过研究广播信道上的有损源编码问题的框架，表明新框架为混合编码方案提供了一种简单的替代方案。另外，推导了窃听广播信道和窃听中继信道的保密率区域（在强保密标准下）的新结果。在一组随附的论文中，我们展示了该框架对于建立协调问题的可实现性结果的有用性，这些问题包括交互式通道仿真，通过中继的协调和通过另一个通道的通道仿真。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号