.png){kind=icon}
返回
An Efficient Polynomial Time Algorithm for Robust Multicast Network Code Construction
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2385079.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For a single source multicast network with failed edges, a robust network code is given to achieve the network capacity by coding only at a subset of edges. Our algorithm provides shaper bounds on the required field size when failure patterns are given. The more required coding edges involved in the linear coding operation, the more computation it takes. The number of required coding edges is minimal in minimal multicast networks employing our algorithm.
Keyword:
Network coding
random linear network coding
efficient algorithm
failure probability
complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容