State of the art-I Intra-Session Nc Achievable rate min-cut[,] LP-formulation[31 v Code design: RNCI4], deterministic[5] 1R Ahlswede, et al, " Network information flow [2]R Koetter and M. M'edard, "An algebraic approach to network coding BJZ. Li, et al, "On Achieving Maximum Multicast Throughput in Undirected Networks 4]T Ho, et al, a random linear network coding approach to multicast [5]S Jaggi, et al, "Polynomial Time algorithms for Multicast Network Code ConstructionIntra-Session NC ✓ Achievable rate = min-cut[1,2] LP-formulation[3] ✓ Code design: RNC[4], deterministic[5] 3 State of the Art - I [1] R. Ahlswede, et al, “Network information flow” [2] R. Koetter and M. M′edard, “An algebraic approach to network coding” [3] Z. Li, et al, “On Achieving Maximum Multicast Throughput in Undirected Networks” [4] T. Ho, et al, “A random linear network coding approach to multicast” [5] S. Jaggi, et al, “Polynomial Time Algorithms for Multicast Network Code Construction