An outer bound for multisource multisink network coding with minimum cost consideration

@article{Yan2006AnOB,
title={An outer bound for multisource multisink network coding with minimum cost consideration},
author={Xijin Yan and Jun Yang and Zhen Zhang},
journal={IEEE Transactions on Information Theory},
year={2006},
volume={52},
pages={2373-2385}
}

The max-flow min-cut bound is a fundamental result in the theory of communication networks, which characterizes the optimal throughput for a point-to-point communication network. The recentwork of Ahlswede et al. extended it to single-source multisink multicast networks and Li et al. proved that this bound can be achieved by linear codes. Following this line, Erez and Feder as well as Ngai and Yeung proved that the max-flow min-cut bound remains tight in single-source two-sink nonmulticastâ€¦Â CONTINUE READING