Elements of information theory
Elements of information theory
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
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
Network Coding Fundamentals
Network Coding: An Introduction
Network Coding: An Introduction
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Zero-error network coding for acyclic networks
IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow
IEEE Transactions on Information Theory
Dualities Between Entropy Functions and Network Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region requires determination of the set of all entropic vectors Γ*, which is known to be an extremely hard problem. On the other hand, calculating the explicitly known linear programming bound is very hard in practice due to an exponential growth in complexity as a function of network size. We give a new, easily computable outer bound, based on characterization of all functional dependencies in networks. We also show that the proposed bound is tighter than some known bounds.