A General Formula for Uniform Common Randomness Capacity

05/09/2022
by   Rami Ezzine, et al.
0

We generalize the uniform common randomness capacity formula, initially established by Ahslwede and Csiszár for a two-source model with unidirectional communication over rate-limited discrete noiseless channels to arbitrary single-user channels. In our proof, we will make use of the transmission capacity formula established by Verdú and Han for arbitrary point-to-point channels.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
07/18/2018

Deep learning the high variability and randomness inside multimode fibres

Multimode fibres (MMF) are remarkable high-capacity information channels...
research
01/08/2019

Construction and Analysis of Posterior Matching in Arbitrary Dimensions via Optimal Transport

The posterior matching scheme, for feedback encoding of a message point ...
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
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
03/21/2018

The Augustin Capacity and Center

The existence of a unique Augustin mean is established for any positive ...

Please sign up or login with your details

Forgot password? Click here to reset