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.

翻译：本文研究了在速率受限的无噪声信道上借助单向通信，从有限复合信源生成公共随机性（CR）的问题。两个通信方（通常称为终端）观测到有限复合信源的独立同分布（i.i.d.）样本，并旨在以高概率针对信源状态的每一种可能实现达成一致的公共随机变量。双方均已知信源状态集合及其统计特性，但未知信源状态的实际实现。我们为指定模型建立了复合CR容量的单字母下界与上界，并进一步给出了两种使所建立界限重合的特殊场景。