A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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.doi:10.1109/tit.2015.2403315 fatcat:622pdcogxjaqrjub2s4ofia5lm