Title :
Subtree decomposition for network coding
Author :
Fragouli, Christina ; Soljanin, Emina
Author_Institution :
EPFL, Lausanne, Switzerland
fDate :
27 June-2 July 2004
Abstract :
A subtree decomposition method for network coding is proposed in this paper. This approach enables derivation of tight bounds on the network code alphabet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.
Keywords :
convolutional codes; graph theory; multicast communication; network topology; convolutional code; network coding; network topology; subtree decomposition; Algorithm design and analysis; Contracts; Convolutional codes; Data mining; Multicast communication; Network coding; Network topology; Scalability; Tree graphs; Vectors;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365181
