Title :
An algebraic approach to network coding
Author :
Koetter, Ralf ; Médard, Muriel
Author_Institution :
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Abstract :
We consider the problem of information flow in networks. In particular, we relate the question whether a set of desired connections can be accommodated in a network to the problem of finding a point on a variety defined over a suitable field. This approach lends itself to the derivation of a number of theorems concerning the feasibility of a communication scenario involving failures
Keywords :
algebraic codes; linear codes; multicast communication; telecommunication network reliability; algebraic approach; communication network coding; communication scenario; desired connections; information flow; network failures; Communication networks; Communication switching; Delay effects; Entropy; Laboratories; Network coding; Random processes; Switches; Tail; Transmitters;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935967
