Low complexity algebraic multicast network codes
Sidharth Jaggi, Philip A. Chou, Kamal Kishore Jain · 2003
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 field sizes which are significantly smaller than those previously known, leading to significantly lower design and implementation complexity, and network link usage. These codes can be extended for networks with cycles and delays, and for robustness properties.