Coordination Using Individually Shared Randomness
Information Theory
2018-05-09 v1 math.IT
Abstract
Two processors output correlated sequences using the help of a coordinator with whom they individually share independent randomness. For the case of unlimited shared randomness, we characterize the rate of communication required from the coordinator to the processors over a broadcast link. We also give an achievable trade-off between the communication and shared randomness rates.
Cite
@article{arxiv.1805.03193,
title = {Coordination Using Individually Shared Randomness},
author = {Gowtham R. Kurri and Vinod M. Prabhakaran and Anand D. Sarwate},
journal= {arXiv preprint arXiv:1805.03193},
year = {2018}
}
Comments
Extended version of a paper accepted for presentation at ISIT 2018. 8 pages, 3 figures