Campus Units

Electrical and Computer Engineering, Mathematics

Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

4-2013

Journal or Book Title

IEEE Journal on Selected Areas in Communications

Volume

31

Issue

4

First Page

655

Last Page

665

DOI

10.1109/JSAC.2013.130404

Abstract

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.

Comments

This is a manuscript of an article published as Ramamoorthy, Aditya, and Michael Langberg. "Communicating the sum of sources over a network." IEEE Journal on Selected Areas in Communications 31, no. 4 (2013): 655-665. DOI: 10.1109/JSAC.2013.130404. Posted with permission.

Rights

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.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

COinS