On the complexity of H-coloring
Journal of Combinatorial Theory Series B
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Deterministic network coding by matrix completion
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Network coding: does the model need tuning?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On average throughput and alphabet size in network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On optimal communication cost for gathering correlated data through wireless sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Network coding theory: single sources
Communications and Information Theory
Foundations and Trends® in Networking
Average throughput with linear network coding over finite fields: the combination network case
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
An overview of network coding for dynamically changing networks
International Journal of Autonomous and Adaptive Communications Systems
Distributed synthesis for well-connected architectures
Formal Methods in System Design
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Network computing capacity for the reverse butterfly network
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Network coding is highly non-approximable
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Low-complexity non-uniform demand multicast network coding problems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Efficient network code design for cyclic networks
IEEE Transactions on Information Theory
Distributed synthesis for well-connected architectures
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Distributed network coding-based opportunistic routing for multicast
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Decidability of well-connectedness for distributed synthesis
Information Processing Letters
| Hi-index | 0.06 |
We address the network information flow problem, in which messages available to a set of sources must be passed through a network to a set of sinks with specified demands. This differs from traditional multicommodity flow, because information can be duplicated and encoded. Previous work has focused on the special case of multicasting using linear coding. In this paper, we explore the applicability of network coding to a breadth of problems and consider the greater potential of nonlinear coding techniques. Our main contribution is a taxonomy of network information flow problems. We establish a three-way partition consisting of problems solvable without resorting to network coding, problems requiring network coding that are polynomial-time solvable, and problems for which obtaining a linear network coding solution is NP-hard. We also demonstrate limitations of linear coding: for multicasting, nonlinear codes may employ a smaller alphabet than any linear code and, more generally, there exist solvable information flow problems that do not admit a linear solution.