On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
An outer bound for multisource multisink network coding with minimum cost consideration
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Matrix games in the multicast networks: maximum information flows with network switching
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network coding theory part II: multiple source
Communications and Information Theory
Network coding theory: single sources
Communications and Information Theory
An overview of network coding for dynamically changing networks
International Journal of Autonomous and Adaptive Communications Systems
Improving the multicommodity flow rates with network codes for two sources
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Network coding capacity: a functional dependence bound
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Constant-rank codes and their connection to constant-dimension codes
IEEE Transactions on Information Theory
Pairwise intersession network coding on directed networks
IEEE Transactions on Information Theory
Full length article: Network capacity of cognitive radio relay network
Physical Communication
| Hi-index | 754.96 |
Consider transmitting a set of information sources through a communication network that consists of a number of nodes. Between certain pair of nodes, there exist communication channels on which information can be transmitted. At a node, one or more information sources may be generated, and each of them is multicast to a set of destination nodes on the network. In this paper, we study the problem of under what conditions a set of mutually independent information sources can be faithfully transmitted through a communication network, for which the connectivity among the nodes and the multicast requirements of the source information are arbitrary except that the connectivity does not form directed cycles. We obtain inner and outer bounds on the zero-error admissible coding rate region in term of the regions ΓN* and Γ~N*, which are fundamental regions in the entropy space defined by Yeung. The results in this paper can be regarded as zero-error network coding theorems for acyclic communication networks.