Answers are grounded in this paper and cite their sources.
We present a low complexity algorithm for designing algebraic codes that achieve the information theoretic capacity for the multicast problem on directed acyclic networks. These codes operate over eld sizes which are signi cantly smaller than those previously known, leading to signi cantly lower design and implementation complexity, and network link usage. These codes can be extended for networks with cycles and delays, and for robustness properties.
No takes yet. Share an insight, caveat, or question.
Jaggi et al. (2003) studied this question.