This article surveys all known fields of network coding theory and leads the reader through
the antecedents of the network coding theory to the most recent results, considering also …

Network coding is a new paradigm in data transport that combines coding with data
propagation over a network. Theory of linear network coding (LNC) adopts a linear coding …

In an acyclic multicast network, it is well known that a linear network coding solution over GF
(q) exists when q is sufficiently large. In particular, for each prime power q no smaller than …

The fundamental result of linear network coding asserts the existence of an optimal code on
an acyclic single-source multicast network when the symbol field is sufficiently large. The …

A condition governing the possibility and impossibility of linear independence among the
global encoding kernels of a linear network code is found. Based on this condition, we …

We consider a communication network where there exist wiretappers who can access a
subset of channels, called a wiretap set, which is chosen from a given collection of wiretap …

We study matroidal networks introduced by Dougherty et al., who showed that if a network is
scalar-linearly solvable over some finite field, then the network is a matroidal network …

We study the problem of information flow in communication networks with noiseless links in
which the dependency relations among the data flowing on the different network edges …

Matroidal networks were introduced by Dougherty et al. and have been well studied in the
recent past. It was shown that a network has a scalar linear network coding solution if and …

In this work, we revisit some combinatorial and information-theoretic extension techniques
for detecting non-algebraic matroids. These are the Dress-Lov\'asz and Ahlswede-K\" orner …