The Redundancy of Slepian-Wolf Coding Revisited

TL;DR

This paper revisits the redundancy in Slepian-Wolf coding, providing simpler proofs and detailed insights into high-order terms, applicable to both fixed-rate and variable-rate scenarios, including normal approximation analysis.

Contribution

It offers simplified proofs of existing results and enhances understanding of high-order terms in Slepian-Wolf coding redundancy.

Findings

Redundancy results are confirmed with simpler proofs.

High-order term details are clarified.

Normal approximation can be derived with minor modifications.

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.