Year: 2022
Type: preprint
Abstract: The channel synthesis problem has been widely investigated over the last decade. In this paper, we consider the sequential version in which the encoder and the decoder work in a sequential way. Under a mild assumption on the target joint distribution we provide a complete (single-letter) characterization of the solution for the point-to-point case, which shows that the canonical symbol-by-symbol mapping is not optimal in general, but is indeed optimal if we make some additional assumptions on the encoder and decoder. We also extend this result to the broadcast scenario and the interactive communication scenario. We provide bounds in the broadcast setting and a complete characterization of the solution under a mild condition on the target joint distribution in the interactive communication case. Our proofs are based on a Rényi entropy method.
Source: arXiv (Cornell University)
Authors: Yu, Lei, Anantharam, Venkat
Institutions: Nankai University, University of California, Berkeley
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G1513559549, NeTS: Small: PTERA: Prospect Theory Enhanced Resource Allocation, G2196882581, CIF: Small: Ensuring robustness of communication between networked energy harvesting nodes, FET: Medium: ROCS: Recurrent Oscillatory Computing Systems for Rapid Solution of NP-Complete and Deep Learning Problems, G5776708844, CIF: Small: Poisson matching: A new tool for information theory, Emerging Frontiers of Science of Information
OpenAlex ID: W4290075176