Distributed Function Computation Over a Rooted Directed Tree

DOI10.1109/TIT.2016.2530398MaRDI QIDQ2976436zbMATH OpenOpenAlexFDO

Authors Milad Sefidgaran, Aslan Tchamkerten

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.3631

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: This paper establishes the rate region for a class of source coding function computation setups where sources of information are available at the nodes of a tree and where a function of these sources must be computed at the root. The rate region holds for any function as long as the sources' joint distribution satisfies a certain Markov criterion. This criterion is met, in particular, when the sources are independent. This result recovers the rate regions of several function computation setups. These include the point-to-point communication setting with arbitrary sources, the noiseless multiple access network with "conditionally independent sources," and the cascade network with Markovian sources.

Cited in

(3)

• Lower bounds for in-network computation of arbitrary functions
• Distributed tree comparison with nodes of limited memory
• Distributed Relationship Schemes for Trees

This page was built for publication: Distributed Function Computation Over a Rooted Directed Tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976436)