Unachievability of network coding capacity
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Cross-layer optimization for wireless multihop networks with pairwise intersession network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
On the multiple unicast network coding conjecture
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Network coding: an excellent approach for overloaded communication era
WSEAS TRANSACTIONS on COMMUNICATIONS
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.06 |
In the network coding problem, there are k commodities each with an associated message Mi, a set of sources that know Mi and a set of sinks that request Mi. Each edge in the graph may transmit any function of the messages. These functions define a network coding solution. We explore three topics related to network coding. First, for a model in which the messages and the symbols transmitted on edges are all from the same alphabet Σ, we prove lower bounds on |Σ|. In one case, we prove |Σ| needs to be doubly-exponential in the size of the network. We also show that it is NP-hard to determine the smallest alphabet size admitting a solution. We then explore the types of functions that admit solutions. In a linear solution over a finite field F the symbol transmitted over each edge is a linear combination of the messages. We show that determining if there exists a linear solution is NP-hard for many classes of network coding problems. As a corollary, we obtain a solvable instance of the network coding problem that does not admit a linear solution over any field F . We then define a model of network coding in which messages are chosen from one alphabet, Γ, and edges transmit symbols from another alphabet, Σ. In this model, we define the rate of a solution as log |Γ|/log |Σ|. We then explore techniques to upper bound the maximum achievable rate for instances defined on directed and undirected graphs. We present a network coding instance in an undirected graph in which the maximum achievable rate is strictly smaller than the sparsity of the graph. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)