Communicating the sum of sources in a 3-sources/3-terminals network; revisited

Michael Langberg, Aditya Ramamoorthy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the problem of multicasting sums over directed acyclic networks with unit capacity edges. A set of source nodes si observe independent unit-entropy source processes Xi and want to communicate Σ Xi to a set of terminals tj. Previous work on this problem has established necessary and sufficient conditions on the si - t j connectivity in the case when there are two sources or two terminals (Ramamoorthy '08), and in the case of three sources and three terminals (Langberg-Ramamoorthy '09). In particular the latter result establishes that each terminal can recover the sum if there are two edge disjoint paths between each si - tj pair. In this work, we provide a new and significantly simpler proof of this result, and introduce techniques that may be of independent interest in other network coding problems.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages1853-1857
Number of pages5
DOIs
StatePublished - 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period13/06/1018/06/10

Fingerprint

Dive into the research topics of 'Communicating the sum of sources in a 3-sources/3-terminals network; revisited'. Together they form a unique fingerprint.

Cite this