Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound
Sergio D. Servetto
Abstract
In this first part, a computable outer bound is proved for the multiterminal source coding problem, for a setup with two encoders, discrete memoryless sources, and bounded distortion measures.
Create a lesson
Related papers
Optimal Communication for Distributed Sparse Histogram Aggregation
Fangwei Ye, Yijun Fan
Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders
Mohsen Moradi, Vahid Nourozi, Wei Tang et al.
Making Every Edit Count: Efficient Binary Edit Correction at the Gilbert-Varshamov Bound
Ryan Gabrys, Shubhransh Singhvi, Eitan Yaakobi
Timely Ground-Station Status Delivery via UAV-Assisted Data Collection and Hierarchical RL
Xiangjian Gao, Mohammad Moltafet, Hamid R. Sadjadpour
Uniform Sampling of Linear Codes with Prescribed Hull Dimension
Keita Ishizuka
Quantum Private Information Retrieval on Forests
Mohamed Nomeir, Sennur Ulukus