Distributed function computation over a tree network

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

Abstract

This paper investigates a distributed function computation setting where the underlying network is a rooted directed tree and where the root wants to compute a function of the sources of information available at the nodes of the network. The main result provides the rate region for an arbitrary function under the assumption that the sources satisfy a general criterion. This criterion is satisfied, in particular, when the sources are independent.

Original languageEnglish
Title of host publication2013 IEEE Information Theory Workshop, ITW 2013
DOIs
Publication statusPublished - 1 Dec 2013
Event2013 IEEE Information Theory Workshop, ITW 2013 - Seville, Spain
Duration: 9 Sept 201313 Sept 2013

Publication series

Name2013 IEEE Information Theory Workshop, ITW 2013

Conference

Conference2013 IEEE Information Theory Workshop, ITW 2013
Country/TerritorySpain
CitySeville
Period9/09/1313/09/13

Fingerprint

Dive into the research topics of 'Distributed function computation over a tree network'. Together they form a unique fingerprint.

Cite this