The Capacity Region of Broadcast Networks with Two Receivers
Elona Erez, Meir Feder · Birkhäuser Basel eBooks · 2004
According to the max-flow min-cut theorem a source s can transmit information to a sink t in a graph (V,E) at a rate that does not exceed the capacity of the minimal cut that separates the source and the sink. Recently, it has been shown that if the intermediate nodes in the network are allowed to code the information that they receive, then the source s can multicast common information to several sinks at a rate that does not exceed the min-cut between the source and any of the individual sinks. In this paper we find the achievable rate region when there are two receiver nodes ti and t2, but we allow both common information at rate Ro and private information rates to ti and t2 at rates R1, R2, respectively.