Source Coding for Synthesizing Correlated Randomness
Source Coding for Synthesizing Correlated Randomness
复制标题
DOI:
10.1109/isit44484.2020.9174002
复制
发表时间:
2020-04
期刊:
影响因子:
--
通讯作者:
Touheed Anwar Atif;Arun Padakandla;S. Pradhan
中科院分区:
文献类型:
--
作者:
Touheed Anwar Atif;Arun Padakandla;S. Pradhan
We consider a scenario wherein two parties Alice and Bob are provided $X_1^n$ and $X_2^n$ - samples that are IID from a PMF ${p_{{X_{\text{1}}}{X_{\text{2}}}}}$. Alice and Bob can communicate to Charles over (noiseless) communication links of rate R1 and R2 respectively. Their goal is to enable Charles generate samples Yn such that the triple $\left( {X_1^n,X_2^n,{Y^n}} \right)$ has a PMF that is close, in total variation, to $\prod {{p_{{X_1}{X_2}Y}}} $. In addition, the three parties may posses shared common randomness at rate C. We address the problem of characterizing the set of rate triples (R1, R2,C) for which the above goal can be accomplished. We provide a set of sufficient conditions, i.e., an achievable rate region for this three party setup. Our work also provides a complete characterization of a point-to-point setup wherein Bob is absent and Charles is provided with side-information.