Communicating the sum of sources over a network
By Aditya Ramamoorthy. 2008
8 citations recorded by the source corpus.
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.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Hariharan Rahul
- Omid Salehi-Abari
- Michael Langberg
- Dina Katabi
- Aditya Ramamoorthy
- Sachin Rajsekhar Katti
- Kaibin Huang
- Guangxu Zhu
In Electrical and Electronic Engineering
- Hariharan Rahul
- Omid Salehi-Abari
- Dina Katabi
- Michael Langberg
- Aditya Ramamoorthy
- Kaibin Huang
- Guangxu Zhu
- Fadel M. Adib
Citations in the corpus
- Over-the-air Function Computation in Sensor Networks (2016, background): “Function Computation: There has been a lot of recent interest in distributed function computation from the information theory community [10, 28, 3, 22, 11].”
- Communicating the Sum of Sources Over a Network (2010, methodology): “Dr. Ramamoorthy is the recipient of the 2012 Iowa State Univers ty’s Early Career Engineering Faculty Research Award, the 2012 NSF CAREER award, and the Harpole-Pentair professorship in 2009 and 2010.”