2000 character limit reached
Distributed Task Encoding
Published 5 May 2017 in cs.IT and math.IT | (1705.02247v1)
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 $\rho$-th moment of the list size, which is derived using the relative $\alpha$-entropy.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.