Common Randomness Generation from Finite Compound Sources

Author:

Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche

Keyword:

Computer Science, Information Theory, Information Theory (cs.IT)

journal:

date:

2024-01-25 00:00:00

Abstract

We investigate the problem of generating common randomness (CR) from finite compound sources aided by unidirectional communication over rate-limited perfect channels. The two communicating parties, often referred to as terminals, observe independent and identically distributed (i.i.d.) samples of a finite compound source and aim to agree on a common random variable with a high probability for every possible realization of the source state. Both parties know the set of source states as well as their statistics. However, they are unaware of the actual realization of the source state. We establish a single-letter lower and upper bound on the compound CR capacity for the specified model. Furthermore, we present two special scenarios where the established bounds coincide.

PDF: Common Randomness Generation from Finite Compound Sources.pdf