Sequential Channel Synthesis

DOI10.1109/TIT.2022.3222201MaRDI QIDQ6197457zbMATH OpenOpenAlexFDO

Authors Lei Yu, Venkat Anantharam

Publication date 19 March 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.03100

zbMATH Keywords

channel synthesis hybrid digital-analog coding Rényi entropy sequential coding symbol-by-symbol mapping

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

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'enyi entropy method.

This page was built for publication: Sequential Channel Synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197457)