Elements of information theory
Elements of information theory
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximation algorithms
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Approximating Directed Multicuts
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
On characterization of entropy function via information inequalities
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Capacity results for the discrete memoryless network
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Zero-error network coding for acyclic networks
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Network coding theory: single sources
Communications and Information Theory
Multicast throughput order of network coding in wireless ad-hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Latent capacity region: a case study on symmetric broadcast with common messages
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Network coding capacity: a functional dependence bound
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
On the multiple unicast network coding conjecture
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the multimessage capacity region for undirected ring networks
IEEE Transactions on Information Theory
Quantum network communication: the butterfly and beyond
IEEE Transactions on Information Theory
Pairwise intersession network coding on directed networks
IEEE Transactions on Information Theory
The serializability of network codes
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
| Hi-index | 0.24 |
An outer bound on the rate region of noise-free information networks is given. This outer bound combines properties of entropy with a strong information inequality derived from the structure of the network. This blend of information theoretic and graph theoretic arguments generates many interesting results. For example, the capacity of directed cycles is characterized. Also, a gap between the sparsity of an undirected graph and its capacity is shown. Extending this result, it is shown that multicommodity flow solutions achieve the capacity in an infinite class of undirected graphs, thereby making progress on a conjecture of Li and Li. This result is in sharp contrast to the situation with directed graphs, where a family of graphs is presented in which the gap between the capacity and the rate achievable using multicommodity flows is linear in the size of the graph.