The Redundancy of Slepian-Wolf Coding Revisited
Abstract
[Draft] In this paper, the redundancy of Slepian Wolf coding is revisited. Applying the random binning and converse technique in yang, the same results in he are obtained with much simpler proofs. Moreover, our results reflect more details about the high-order terms of the coding rate. The redundancy is investigated for both fixed-rate and variable-rate cases. The normal approximation (or dispersion) can also be obtained with minor modification.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.