Some results on communicating the sum of sources over a network
| dc.creator | Rai, Brijesh Kumar | |
| dc.creator | Dey, Bikash Kumar | |
| dc.creator | Karandikar, Abhay | |
| dc.date | 2008-11-03 | |
| dc.date.accessioned | 2026-07-07T10:14:53Z | |
| dc.date.available | 2026-07-07T10:14:53Z | |
| dc.description | We consider the problem of communicating the sum of $m$ sources to $n$ terminals in a directed acyclic network. Recently, it was shown that for a network of unit capacity links with either $m=2$ or $n=2$, the sum of the sources can be communicated to the terminals if and only if every source-terminal pair is connected in the network. We show in this paper that for any finite set of primes, there exists a network where the sum of the sources can be communicated to the terminals only over finite fields of characteristic belonging to that set. As a corollary, this gives networks where the sum can not be communicated over any finite field even though every source is connected to every terminal. | |
| dc.description | 5 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/0811.0285 | |
| dc.identifier | http://arxiv.org/abs/0811.0285 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173041 | |
| dc.subject | Information Theory | |
| dc.title | Some results on communicating the sum of sources over a network | |
| dc.type | text |