DocumentCode :
2518395
Title :
Communicating the sum of sources over a network
Author :
Ramamoorthy, Aditya
Author_Institution :
Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA
fYear :
2008
fDate :
6-11 July 2008
Firstpage :
1646
Lastpage :
1650
Abstract :
We consider a network (that is capable of network coding) with a set of sources and terminals, where each terminal is interested in recovering the sum of the sources. Considering directed acyclic graphs with unit capacity edges and independent, unit-entropy sources, we show the rate region when (a) there are two sources and n terminals, and (b) n sources and two terminals. In these cases as long as there exists at least one path from each source to each terminal we demonstrate that there exists a valid assignment of coding vectors to the edges such that the terminals can recover the sum of the sources.
Keywords :
directed graphs; entropy codes; multicast communication; network theory (graphs); source coding; coding vector assignment; directed acyclic graphs; multicast capacity; network coding; unit capacity edges; unit-entropy sources; Arithmetic; Entropy; Galois fields; Network coding; Routing; Source coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
Type :
conf
DOI :
10.1109/ISIT.2008.4595267
Filename :
4595267
Link To Document :
بازگشت