Application Of Network Coding Research Articles

Network coding for efficient network multicast

Network coding has emerged as a powerful technique based on a simple but far-reaching observation that, in communication networks, one can allow intermediate nodes to not only forward but also combine and process the incoming information flows. Today, the field is attracting significant interest from both academia and industry, and we are beginning to see the first practical applications. In this survey paper, we first review the main ideas, concepts, and applications of network coding. We then discuss some of the algorithmic aspects of performing network multicast efficiently with network coding. Lastly, we give an overview of a few quantitative results that compare the performance of network coding with that of traditional routing in certain types of communication networks.

Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams

Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the projective space. In this paper, we propose a method to design error-correcting codes in the projective space. We use a multilevel approach to design our codes. First, we select a constant-weight code. Each codeword defines a skeleton of a basis for a subspace in reduced row echelon form. This skeleton contains a Ferrers diagram on which we design a rank-metric code. Each such rank-metric code is lifted to a constant-dimension code. The union of these codes is our final constant-dimension code. In particular, the codes constructed recently by Koetter and Kschischang are a subset of our codes. The rank-metric codes used for this construction form a new class of rank-metric codes. We present a decoding algorithm to the constructed codes in the projective space. The efficiency of the decoding depends on the efficiency of the decoding for the constant-weight codes and the rank-metric codes. Finally, we use puncturing on our final constant-dimension codes to obtain large codes in the projective space which are not constant-dimension.

Network Coding for the Internet and Wireless Networks

In today's practical communication networks such as the Internet, information delivery is performed by routing. A promising generalization of routing is network coding. The potential advantages of network coding over routing include resource (e.g., bandwidth and power) efficiency, computational efficiency, and robustness to network dynamics. This tutorial article provides an overview of the theory, practice, and applications of network coding.