首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing >On a capacity equivalence between multiple multicast and multiple unicast
【24h】

On a capacity equivalence between multiple multicast and multiple unicast

机译:在多播和多个单播之间的容量等效

获取原文

摘要

An equivalence between multiple multicast and multiple unicast network coding is proven in a 2007 paper by Dougherty and Zeger. The result is extended to index coding under the assumption of linear coding in recent work by Maleki et al. In this work, we extend the result to arbitrary (e.g. possibly noisy) memoryless networks under an asymptotic definition of reliability. We show the equivalence for non-linear index codes as a special case. Our result implies that solving the multiple unicast communication problem is sufficient to solve all communication problems in memoryless networks.
机译:通过Dougherty和Zeger在2007纸上证明了多个多播和多个单播网络编码之间的等价。在Malegki等人的最后工作中的线性编码假设下,结果扩展到索引编码。在这项工作中,我们在可靠性的渐近定义下将结果扩展到任意(例如可能嘈杂的)无记忆网络。我们向非线性索引代码显示为特例的等价性。我们的结果意味着解决多种单播通信问题足以解决无记忆网络中的所有通信问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号