• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Network Coding in Node-Constrained Line and Star Networks
【24h】

Network Coding in Node-Constrained Line and Star Networks

机译：节点约束线和星形网络中的网络编码

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

摘要

Line and star networks with both node and edge constraints are studied in the network coding framework. For line networks, the capacity region of the general multiple multicast problem is established. The coding theorem is based on a binary linear coding scheme, while the converse requires new upper bounds that improve on standard cut-based bounds. For star networks, the multiple unicast problem is examined. Capacity upper bounds are derived and a simple linear coding scheme is proposed which is based on the combinatorial optimization problem of cycle packing in directed graphs. The optimality of this scheme is established for a broad class of demands. The connection of node-constrained network coding in star networks, and index coding with side information is discussed and used to partially characterize the optimal linear code for general rates.
机译：在网络编码框架中研究了具有节点和边缘约束的线形和星形网络。对于线路网络，建立了一般多重组播问题的容量区域。编码定理基于二进制线性编码方案，而反之则需要新的上限，该上限在基于标准割的界限上有所改进。对于星型网络，将检查多个单播问题。推导了容量上限，并基于有向图循环填充的组合优化问题，提出了一种简单的线性编码方案。针对广泛的需求类别确定了该方案的最优性。讨论了星形网络中受节点约束的网络编码和带有辅助信息的索引编码的连接，并将其用于部分表征一般速率的最佳线性编码。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号