Distributed Task Encoding
Annina Bracher, Amos Lapidoth, Christoph Pfister

TL;DR
This paper characterizes the rate region for task encoding of two correlated sources using a new family of dependence measures and introduces a novel expression for the list size moment based on relative alpha-entropy.
Contribution
It introduces a novel parametric family of dependence measures and a new expression for the list size moment in task encoding, advancing theoretical understanding.
Findings
Characterization of the rate region using new dependence measures
Derivation of a new expression for the list size moment
Application of relative alpha-entropy in the converse proof
Abstract
The rate region of the task-encoding problem for two correlated sources is characterized using a novel parametric family of dependence measures. The converse uses a new expression for the -th moment of the list size, which is derived using the relative -entropy.
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
TopicsStatistical Mechanics and Entropy · Wireless Communication Security Techniques · Diffusion and Search Dynamics
