The Redundancy of Slepian-Wolf Coding Revisited
Information Theory
2013-05-09 v1 math.IT
Abstract
[Draft] In this paper, the redundancy of Slepian Wolf coding is revisited. Applying the random binning and converse technique in \cite{yang}, the same results in \cite{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.
Keywords
Cite
@article{arxiv.1305.1730,
title = {The Redundancy of Slepian-Wolf Coding Revisited},
author = {Duo Xu},
journal= {arXiv preprint arXiv:1305.1730},
year = {2013}
}