2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | I.5.2 | ||
| Paper Title | Source Coding for Synthesizing Correlated Randomness | ||
| Authors | Touheed Anwar Atif, University of Michigan Ann Arbor, United States; Arun Padakandla, University of Tennessee at Knoxville, United States; S. Sandeep Pradhan, University of Michigan Ann Arbor, United States | ||
| Session | I.5: Network Information Theory | ||
| Presentation | Lecture | ||
| Track | Network Information Theory | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | 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_1 X_2}$. Alice and Bob can communicate to Charles over (noiseless) communication links of rate $R_1$ and $R_2$ respectively. Their goal is to enable Charles generate samples $Y^{n}$ such that the triple $(X_{1}^{n},X_{2}^{n},Y^{n})$ 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 $(R_1,R_2,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. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
