Communicating the sum of sources in a 3-sources/3-terminals network; revisited

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1853-1857

  Langberg, Michael ^a   Ramamoorthy, Aditya ^b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; EDGE DISJOINT PATHS; ENTROPY SOURCES; IF THERE ARE; NETWORK CODING; SOURCE NODES; SUFFICIENT CONDITIONS; TWO SOURCES; UNIT CAPACITY;

MULTICASTING;

INFORMATION THEORY;

EID: 77955674549     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513422     Document Type: Conference Paper

References (6)

1. A. Ramamoorthy, "Communicating the sum of sources over a network," in IEEE Intl. Symposium on Info. Th., 2008, pp. 1646-1650.
2. M. Langberg and A. Ramamoorthy, "Communicating the sum of sources in a 3-sources/3-terminals network," in IEEE Intl. Symposium on Info. Th., 2009, pp. 2121-2125.
3. B. K. Rai, B. K. Dey, and A. Karandikar, "Some results on communicating the sum of sources over a network," in NetCod, 2009.
4. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," IEEE Trans. on Info. Th., vol. 52, no. 6, pp. 2386-2397, 2006.
5. M. Langberg and A. Ramamoorthy, "Communicating the sum of sources in a 3-sources/3-terminals network," Manuscript, 2009, available at http://www.openu.ac.il/home/mikel/ISIT09/ISIT09.pdf.
6. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "A Random Linear Network Coding Approach to Multicast," IEEE Trans. on Info. Th., vol. 52, no. 10, pp. 4413-4430, 2006. (Pubitemid 46445282)