2000 character limit reached
Distributed Multilevel Diversity Coding
Published 30 Apr 2015 in cs.IT and math.IT | (1505.00026v1)
Abstract: In distributed multilevel diversity coding, $K$ correlated sources (each with $K$ components) are encoded in a distributed manner such that, given the outputs from any $\alpha$ encoders, the decoder can reconstruct the first $\alpha$ components of each of the corresponding $\alpha$ sources. For this problem, the optimality of a multilayer Slepian-Wolf coding scheme based on binning and superposition is established when $K\leq 3$. The same conclusion is shown to hold for general $K$ under a certain symmetry condition, which generalizes a celebrated result by Yeung and Zhang.
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.