An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A framework for linear information inequalities
IEEE Transactions on Information Theory
A non-Shannon-type conditional inequality of information quantities
IEEE Transactions on Information Theory
On characterization of entropy function via information inequalities
IEEE Transactions on Information Theory
On symmetrical multilevel diversity coding
IEEE Transactions on Information Theory
Distributed source coding for satellite communications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Zero-error network coding for acyclic networks
IEEE Transactions on Information Theory
Multilevel diversity coding with distortion
IEEE Transactions on Information Theory
Network coding theory: single sources
Communications and Information Theory
Network coding capacity: a functional dependence bound
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Pairwise intersession network coding on directed networks
IEEE Transactions on Information Theory
Hi-index | 0.06 |
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 networks. But the max-flow min-cut bound is in general quite loose (see Yeung, 2002). On the other hand, the admissible rate region of communication networks has been studied by Yeung and Zhang as well as Song and Yeung, but the bounds obtained by these authors are not explicit. In this work, we prove a new explicit outer bound for arbitrary multisource multisink networks and demonstrate its relation with the minimum cost network coding problem. We also determine the capacity region for a special class of three-layer networks.