Consider a communication network in which a source node wishes to multicast information to some sink nodes on the network. In the traditional setting, every node can only pass on the data it receives from incoming links to the links leaving it. We consider an extended setting which gives the intermediate nodes more “power”. In our model, each node may send any linear combination of the received...

We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delay-free networks, a bound on error probability, in terms of the number of receivers and random coding output link...

Quantum information processing has been stimulating many fields since it has been founded by many researchers that the quantum mechanics offers us new ways of information processing such as fast algorithms, secure cryptosystems, and distributed computing. But in general, quantum information is much more difficult to handle than classical information. So it would be desirable if we could reduce ...

A fundamental understanding of the relationship between delay performance and complexity in network coding is instrumental towards its application in practical systems. The main argument against delay-optimal random linear network coding (RLNC) is its decoding complexity, which is O(n) for n original packets. Fountain codes, such as LT and Raptor codes, reduce the decoding load on the receiver ...

NECO is a simple high-performance simulation framework dedicated to the evaluation of Network Coding based protocols. Its main features include (1) definition of graphs representing the topology (which can be randomly generated by NECO or given through a standard representation), (2) the modular specification of network coding protocols, (3) visualization of network operations and seamless stat...

We consider the ability of a distributed randomized network coding approach to multicast, to one or more receivers, correlated sources over a network where compression may be required. We give, for two arbitrarily correlated sources in a general network, upper bounds on the probability of decoding error at each receiver, in terms of network parameters. In the special case of a Slepian-Wolf sour...

We consider a sensor network where distributed source coding and network coding are used. We show how to design distributed source coding and network coding jointly to optimize the compression efficiency and network robustness tradeoff.

These Network Coding improves the network operation beyond the traditional routing or store-and-forward, by mixing of data stream within a network. Network coding techniques explicitly minimizes the total no of transmission in wireless network. The Coding-aware routing maximizes the coding opportunity by finding the coding possible path for every packet in the network. Here we propose CORMEN: a...

A combinatorial framework for adversarial network coding is presented. Channels are described by specifying the possible actions that one or more (possibly coordinated) adversaries may take. Upper bounds on three notions of capacity—the one-shot capacity, the zero-error capacity, and the compound zero-error capacity—are obtained for point-to-point channels, and generalized to corresponding capa...