Title :
Network coding from a network flow perspective
Author :
Ho, Tracey ; Karger, David R. ; Médard, Muriel ; Koetter, Ralf
Author_Institution :
Massachusetts Inst. of Technol., Cambridge, MA, USA
fDate :
29 June-4 July 2003
Abstract :
Precise connections between algebraic network coding and network flows are explained in this article. Our combinatorial formulations offer new insights, mathematical simplicity, and lead to a substantially tighter upper bound on the coding field size required for a given connection problem than that in R. Koetter et al.
Keywords :
algebraic codes; combinatorial mathematics; linear codes; multicast communication; telecommunication networks; algebraic network coding; combinatorial formulation; mathematical simplicity; network flows; Bipartite graph; Galois fields; Joining processes; Network coding; Random processes; Signal generators; Signal processing; Sufficient conditions; Upper bound;
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
DOI :
10.1109/ISIT.2003.1228458
