On the Relationship between Redundancy and Decoding Error in Slepian-Wolf Coding

The relationship between redundancy and decoding error in Slepian-Wolf coding with one encoder is investigated. For any memoryless sourceside information pair (X,Y) = {(Xi, Yi)}i¿ with finite alphabet, the redundancy Rn(¿n) of Slepian-Wolf coding is defined as the minimum of the difference between the compression rate of any Slepian-Wolf code resulting from coding Xn with decoding error ¿n, and the conditional entropy H(X|Y). When ¿n denotes the block error probability in decoding, it is shown that under mild assumptions, Rn(¿n) = (see Equation in PDF). When ¿n denotes the average symbol error in decoding, this relationship is further shown to hold for fixed-rate Slepian-Wolf coding.