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 source-side information pair (X,Y) = {(X_i,Y_i)}_iinfin=1 with finite alphabet, the redundancy R_n(epsi_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 X ₁ ⁿ with decoding error epsi_n, and the conditional entropy H(X|Y). When epsi_n denotes the block error probability in decoding, it is shown that under mild assumptions, R_n(epsi_n) = thetas(radic(-(log epsi_n )/n)). When epsi_n denotes the average symbol error in decoding, this relationship is further shown to hold for fixed-rate Slepian-Wolf coding