Communicating the sum of sources over a network
| dc.creator | Ramamoorthy, Aditya | |
| dc.date | 2008-05-01 | |
| dc.date.accessioned | 2026-07-07T09:36:23Z | |
| dc.date.available | 2026-07-07T09:36:23Z | |
| dc.description | 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. | |
| dc.description | 5 pages, Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008 | |
| dc.identifier | https://arxiv.org/abs/0805.0051 | |
| dc.identifier | http://arxiv.org/abs/0805.0051 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160100 | |
| dc.subject | Information Theory | |
| dc.title | Communicating the sum of sources over a network | |
| dc.type | text |