Coordination capacity

Authors:
Paul Warner Cuff;Haim H. Permuter;Thomas M. Cover
Affiliations:
Department of Electrical Engineering at Princeton University, Princeton, NJ;Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Electrical Engineering, Stanford University, Stanford, CA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 14
Cited 0

New results in binary multiple descriptions

IEEE Transactions on Information Theory
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On Mult-iResolution Coding and a Two-Hop Network

DCC '06 Proceedings of the Data Compression Conference
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Distributed average consensus with least-mean-square deviation

Journal of Parallel and Distributed Computing
Cascade multiterminal source coding

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Simulation of random processes and rate-distortion theory

IEEE Transactions on Information Theory
Source coding theory for a triangular communication system

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Coding for computing

IEEE Transactions on Information Theory
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

IEEE Transactions on Information Theory
The empirical distribution of rate-constrained source codes

IEEE Transactions on Information Theory
Communicating Probability Distributions

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

We develop elements of a theory of cooperation and coordination in networks. Rather than considering a communication network as a means of distributing information, or of reconstructing random processes at remote nodes, we ask what dependence can be established among the nodes given the communication constraints. Specifically, in a network with communication rates {Ri,j} between the nodes, we ask what is the set of all achievable joint distributions p(x1, . . . , xm) of actions at the nodes of the network. Several networks are solved, including arbitrarily large cascade networks. Distributed cooperation can be the solution to many problems such as distributed games, distributed control, and establishing mutual information bounds on the influence of one part of a physical system on another.