Output Constrained Lossy Source Coding with Limited Common Randomness
Naci Saldi, Tam\'as Linder, Serdar Y\"uksel

TL;DR
This paper characterizes the optimal tradeoff between coding rate and common randomness in constrained lossy source coding, extending previous work to scenarios with limited shared randomness and exploring the impact of relaxing distribution constraints.
Contribution
It provides a complete characterization of achievable rate pairs under common randomness constraints, including variations with relaxed output distribution and private randomness.
Findings
Achieves the optimal rate region for limited common randomness.
Shows that separated channel synthesis is suboptimal for this problem.
Connects the results to distributed channel synthesis literature.
Abstract
This paper studies a Shannon-theoretic version of the generalized distribution preserving quantization problem where a stationary and memoryless source is encoded subject to a distortion constraint and the additional requirement that the reproduction also be stationary and memoryless with a given distribution. The encoder and decoder are stochastic and assumed to have access to independent common randomness. Recent work has characterized the minimum achievable coding rate at a given distortion level when unlimited common randomness is available. Here we consider the general case where the available common randomness may be rate limited. Our main result completely characterizes the set of achievable coding and common randomness rate pairs at any distortion level, thereby providing the optimal tradeoff between these two rate quantities. We also consider two variations of this problem…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
