The Redundancy of Slepian-Wolf Coding Revisited
D Xu - arXiv preprint arXiv:1305.1730, 2013 - arxiv.org
D Xu
arXiv preprint arXiv:1305.1730, 2013•arxiv.org[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.
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.
[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.
arxiv.org
顯示最佳搜尋結果。 查看所有結果