Achievable rate regions for network coding

摘要

Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. We describe the achievable rate regions for three interesting networks and show that achievable rate regions for linear codes need not be convex.