...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Multicasting Multiple Correlated Sources to Multiple Sinks Over a Noisy Channel Network
【24h】

Multicasting Multiple Correlated Sources to Multiple Sinks Over a Noisy Channel Network

机译：通过噪声信道网络将多个相关源组播到多个接收器

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

摘要

The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li, and Yeung in 2000, in which they have established the celebrated max-flow min-cut theorem on nonphysical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with multiple correlated sources and a single sink from the viewpoint of polymatroidal functions in which a necessary and sufficient condition has been demonstrated for reliable transmission over the network. This paper presents an attempt to unify both cases, which leads to establish a necessary and sufficient condition for reliable transmission over a network for multicasting multiple correlated sources to multiple sinks. Here, the problem of separation of source coding and network coding is also discussed.
机译：Ahlswede，Cai，Li和Yeung于2000年首先研究了将单个源多播到多个接收器的网络编码问题，他们建立了著名的关于网络上非物理信息流的最大流最小割定理。独立渠道。另一方面，在1980年，Han从多脉动函数的角度研究了具有多个相关源和单个接收器的情况，其中已经证明了通过网络进行可靠传输的必要条件和充分条件。本文提出了试图统一这两种情况的尝试，这为建立网络上可靠传输的必要条件和充分条件，以便将多个相关源组播到多个接收器。在此，还讨论了源编码和网络编码分离的问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号