Common Randomness Generation from Gaussian Sources

01/26/2022
by   Wafa Labidi, et al.
0

We study the problem of common randomness (CR) generation in the basic two-party communication setting in which the sender and the receiver aim to agree on a common random variable with high probability by observing independent and identically distributed (i.i.d.) samples of correlated Gaussian sources and while communicating as little as possible over a noisy memoryless channel. We completely solve the problem by giving a single-letter characterization of the CR capacity for the proposed model and by providing a rigorous proof of it. Interestingly, we prove that the CR capacity is infinite when the Gaussian sources are perfectly correlated.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

Common Randomness Generation from Sources with Countable Alphabet

We study a standard two-source model for common randomness (CR) generati...
research
05/09/2023

A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity

We consider a standard two-source model for uniform common randomness (U...
research
02/01/2021

Common Randomness Generation over Slow Fading Channels

This paper analyzes the problem of common randomness (CR) generation fro...
research
08/22/2019

Coordination Through Shared Randomness

We study a distributed sampling problem where a set of processors want t...
research
06/26/2019

On the Common Randomness Capacity of a Special Class of Two-way Channels

In this paper, we would like to study the common randomness (CR) capacit...
research
09/30/2018

On Exact and ∞-Rényi Common Informations

Recently, two extensions of Wyner's common information — exact and Rényi...
research
02/02/2020

The Gaussian lossy Gray-Wyner network

We consider the problem of source coding subject to a fidelity criterion...

Please sign up or login with your details

Forgot password? Click here to reset