Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Complexity classification of network information flow problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On average throughput and alphabet size in network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Linearity and solvability in multicast networks
IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow
IEEE Transactions on Information Theory
Information flow decomposition for network coding
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We characterize the average linear network coding throughput, Tcavg, for the combination network with min-cut 2 over an arbitrary finite field. We also provide a network code, completely specified by the field size, achieving Tcavg for the combination network.