Electrical and Computer Engineering, Mathematics
Journal or Book Title
IEEE Journal on Selected Areas in Communications
We consider the network communication scenario, over directed acyclic networks with unit capacity edges in which a number of sources si each holding independent unit-entropy information Xi wish to communicate the sum ΣXi to a set of terminals tj. We show that in the case in which there are only two sources or only two terminals, communication is possible if and only if each source terminal pair si/tj is connected by at least a single path. For the more general communication problem in which there are three sources and three terminals, we prove that a single path connecting the source terminal pairs does not suffice to communicate ΣXi. We then present an efficient encoding scheme which enables the communication of ΣXi for the three sources, three terminals case, given that each source terminal pair is connected by two edge disjoint paths.
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Ramamoorthy, Aditya and Langberg, Michael, "Communicating the Sum of Sources Over a Network" (2013). Electrical and Computer Engineering Publications. 111.