About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 2006
Conference paper
A lower bound for variable rate slepian-wolf coding
Abstract
In this paper we analyze the redundancy of variable rate Slepian-Wolf coding. For any memoryless source-side information pair (X, Y) = {(X i, Yi)}i=1∞ with finite alphabet, the redundancy Rn(∈n) of variable rate Sepian-Wolf coding is defined as the minimum of the difference between the compression rate of any variable-rate Slepian-Wolf code resulting from coding X1n with decoding error probability ∈n, and the conditional entropy H(XΙY). It is proved that under mild assumptions, for sufficiently large n, Rn (∈n) is lower bounded by d√/logn/n, where d > 0 is a constant. © 2006 IEEE.