Chapter 21: Network Coding over Noiseless Networks

Learning Objectives

• State and prove the max-flow min-cut theorem for single unicast over directed graphs
• Explain why routing alone is insufficient for multicast and how network coding achieves the max-flow bound
• Construct linear network codes over finite fields and verify their correctness
• Describe random linear network coding and analyze its error probability
• Discuss the difficulty of the multi-source multi-sink problem and known achievable rate regions
• Connect network coding to practical content distribution, coded caching, and noisy relay networks