Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
A network of nodes communicate via point-to-point memoryless independent noisy channels. Each node has some realvalued initial measurement or message. The goal of each of the nodes is to acquire an estimate of a given function of all the initial measurements in the network. As the main contribut...
Main Authors: | Ayaso, Ola, Shah, Devavrat, Dahleh, Munther A. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers / IEEE Information Theory Society
2011
|
Online Access: | http://hdl.handle.net/1721.1/62819 https://orcid.org/0000-0002-1470-2148 https://orcid.org/0000-0003-0737-3259 |
Similar Items
-
Information theoretic bounds for distributed computation
by: Ayaso, Ola.
Published: (2009) -
Lower bounds on the estimation error in problems of distributed computation
by: Como, Giacomo, et al.
Published: (2010) -
Distributed computation of fixed points
Published: (2002) -
Variable-width channel allocation for access points : a game-theoretic perspective
by: Yuan, Wei, et al.
Published: (2013) -
Bounded-Degree Polyhedronization of Point Sets
by: Barequet, Gill, et al.
Published: (2011)