Random Network Coding relies on using random codes at nodes for multicast or incast networks.
It was originally proposed in - T. Ho, R. Koetter, M. Médard, D. R. Karger and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting" 2003 IEEE International Symposium on Information Theory. Full paper
It was later applied in the paper – P. A. Chou, Y. Wu, and K. Jain, Practical network coding, in Allerton Conference on Communication, Control, and Computing, Monticello,IL, 2003.
Lately it has gained attention for file sharing systems in the BBC News- http://news.bbc.co.uk/1/hi/technology/4110302.stm and
http://www.research.microsoft.com/~pablo/papers/nc_contentdist.pdf
Analysis of performance can be found in S. Acedanski, S. Deb, M. Médard, R. Koetter , "How Good is Random Linear Coding Based Distributed Networked Storage?", NetCod 2005
Network Coding for Wireless Applications: A Brief Tutorial
A very brief overview of the benefits of network coding for wireless applications
| For a brief overview of network coding, including random network coding and issues, see presentation below: | |
|
|
| For some background on the theory of random network coding see below: | |
|
|
| For its relationship to distributed compression: see below: | |
|
|
| For the use of randomized network coding for security and in particular Byzantine reliability, see below: | |
|