Exact Channel Synthesis

10/30/2018
by   Lei Yu, et al.
0

We consider the exact channel synthesis problem, which is the problem of determining how much information is required to create exact correlation remotely when there is a certain amount of randomness shared by two terminals. This problem generalizes an existing approximate version, in which the generated joint distribution is restricted to be close to a target distribution under the total variation (TV) distance measure, instead being exactly equal to the target distribution. We study the admissible region of the shared randomness rate and the communication rate for the exact channel synthesis problem by providing single-letter inner and outer bounds on it. The inner bound implies that a linear number of bits (or a finite rate) of shared randomness suffices to realize exact channel synthesis, even when communication rates are restricted to approach to the optimal communication rate I(X;Y) asymptotically. This disproves a conjecture posed by Bennett-Devetak-Harrow-Shor-Winter (2014), where they conjectured that under this scenario, an exponential number of bits of shared randomness is necessary to realize exact channel synthesis. Furthermore, our bounds coincide for doubly symmetric binary sources (or binary symmetric channels), which implies that for such sources, the admissible rate region is completely characterized. We observe that for such sources, the admissible rate region for exact channel synthesis is strictly larger than that for TV-approximate version. We also extend these results to other sources, including Gaussian sources.

READ FULL TEXT

page 1

page 2

page 3

page 4

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/24/2021

Multiple Access Channel Simulation

We study the problem of simulating a two-user multiple access channel ov...
research
06/17/2019

Distributed Source Simulation With No Communication

We consider the problem of distributed source simulation with no communi...
research
08/22/2019

Coordination Through Shared Randomness

We study a distributed sampling problem where a set of processors want t...
research
02/07/2022

Sequential Channel Synthesis

The channel synthesis problem has been widely investigated over the last...
research
06/08/2023

Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation

We study the mean estimation problem under communication and local diffe...
research
05/08/2018

Coordination Using Individually Shared Randomness

Two processors output correlated sequences using the help of a coordinat...

Please sign up or login with your details

Forgot password? Click here to reset