Subtree decomposition for network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 145-

  Fragouli, Christina ^a   Soljanin, Emina ^b  

^a EPFL   (Switzerland)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRIC OBJECTS; NETWORK CODING; SUBTREE DECOMPOSITION; SUBTREE GRAPHS;

ALGORITHMS; CONVOLUTION; DECOMPOSITION; GRAPH THEORY; KNOWLEDGE ACQUISITION; MULTICASTING; SIGNAL ENCODING; TELECOMMUNICATION LINKS; TOPOLOGY; VECTORS;

NETWORK PROTOCOLS;

EID: 5044245848     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. S-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Transactions on Information Theory, Vol. 49, pp. 371-381, Feb. 2003.
2. C. Fragouli, E. Soljanin, and A. Shokrollahi "Network coding as a coloring problem," CISS 2004, Princeton, March 2003.
3. C. Fragouli and E. Soljanin "Information Flow Decomposition for Network Multicast" submitted to IEEE Transactions on Information Theory, available at http://cm.bell-labs.com/cm/ms/who/emina/.