Year: 2020
Type: article
Abstract: We consider the following communication task in the multi-party setting, which involves joint random variables X Y Z M N with the property that M is independent of Y Z N conditioned on X, and N is independent of X Z M conditioned on Y . Three parties Alice, Bob and Charlie, respectively, observe samples x, y and z from X Y Z. Alice and Bob communicate messages to Charlie with the goal that Charlie can output a sample (m, n) such that the distribution of (x, y, z, m, n) is close to X Y Z M N. This task reflects the simultaneous message passing communication complexity. Furthermore, it is a generalization of some well studied problems in information theory, such as distributed source coding, source coding with a helper and one sender and one receiver message compression. It is also closely related to the lossy distributed source coding task. Our main result is an achievable communication region for this task in the one-shot setting, through which we obtain a nearly optimal characterization using auxiliary random variables of bounded size. We employ our achievability result to provide a nearly optimal one-shot communication region for the task of lossy distributed source coding, in terms of auxiliary random variables of bounded size. Finally, we show that interactions are necessary to achieve the optimal expected communication cost.
Authors: Anurag Anshu, Penghui Yao
Institutions: University of Waterloo, Perimeter Institute, Nanjing University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G4980195822, 基于信息论的量子通信复杂性研究
OpenAlex ID: W2999846770