.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Network coding
random linear network coding
efficient algorithm
failure probability
complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.