Universal Coding of Ergodic Sources for Multiple Decoders with Side Information
Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu

TL;DR
This paper demonstrates that in multiterminal lossy coding, all achievable rate-distortion points can be attained without prior knowledge of source statistics, unifying several existing problems.
Contribution
It introduces a universal coding scheme for ergodic sources in multiterminal settings with side information, covering multiple classical problems as special cases.
Findings
Achievable rate-distortion points are attainable universally.
The scheme works without knowledge of source statistics.
Includes problems like Wyner-Ziv and complementary delivery as special cases.
Abstract
A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be attained even if the source statistics are not known.
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.
Taxonomy
TopicsWireless Communication Security Techniques · Cellular Automata and Applications · Chaos-based Image/Signal Encryption
