This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding ...

•In the scenario where the total traffic is split and carried separately by network coding and a limited number of multicast trees (one or two), a high throughput can be maintained when the part of traffic managed by multicast trees is reduced and handled by network coding. • In most instances considered (random generated graphs), coding at the source node is enough to achieve optimal throughpu...

Article history: Received 16 September 2011 Received in revised form 27 December 2012 Accepted 31 December 2012 Available online 23 January 2013

In order to reduce the increase of network delay and excessive energy consumption, which are caused by network code in WSNs, a fast random linear mechanism of network coding based on nodes collaboration is introduced. Energy consumption of nodes is reduced by transmitting the initial code of the node, and transmitting linear independent packets received merely. After gathering node coding, ACK ...

Non-adaptive joint source network coding of correlated sources is discussed in this paper. By studying the information flow in the network, we propose quantized network coding as an alternative for packet forwarding. This technique has both network coding and distributed source coding advantages, simultaneously. Quantized network coding is a combination of random linear network coding in the (i...

Han, Jaemin Ph.D., Purdue University, December 2013. Multi-session Network Coding Characterization using New Linear Coding Frameworks. Major Professor: ChihChun Wang Professor. Recently, Network Coding (NC) has emerged as a promising technique in modern communication networks and has shown extensive potentials in practical implementations and theoretical developments. Nevertheless, the NC probl...

Constructing k independent sessions between k source-sink pairs with the help of a linear operation at each vertex is one of the most standard problems in network coding. For an unbounded k, this is known to be NP-hard. Very recently, a polynomial-time algorithm was given for k = 2 [Wang and Shroff, ISIT 2007], but was open for a general (constant) k. This paper gives a polynomial-time algorith...

Recently, random linear network coding has been widely applied in peer-to-peer network applications. Instead of sharing the raw data with each other, peers in the network produce and send encoded data to each other. As a result, the communication protocols have been greatly simplified, and the applications experience higher end-to-end throughput and better robustness to network churns. Since it...