pith. sign in

arxiv: 1805.03193 · v1 · pith:U7PZPIAZnew · submitted 2018-05-08 · 💻 cs.IT · math.IT

Coordination Using Individually Shared Randomness

classification 💻 cs.IT math.IT
keywords randomnesssharedcommunicationcoordinatorindividuallyprocessorsachievablebroadcast
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.