.png){kind=icon}
返回
On Network Coding for Funnel Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2015.2477816.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Network coding for non-multicast problems has been the subject of many recent studies. In this letter, we consider networks in which the total capacity of the incoming links to each intermediate node is not less than the total capacity of its outgoing links. We call these networks funnel networks and prove that any feasible non-multicast problem on funnel networks is solvable by routing (hence, by linear network coding, too). The desirability of network coding in funnel networks may be justified by the other benefits that coding offers. However, we see that in funnel networks, the conventional random approach to linear coding fails with high probability. Hence, we provide a new random linear network coding solution for these non-multicast problems.
Keyword:
Network information theory
random linear network coding
non-multicast problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容