On the redundancy of variable-rate Slepian-Wolf coding

In this paper, we investigate a trade-off between the error probability and the redundancy of Slepian-Wolf coding in finite blocklength regime. It is demonstrated that, by combining the information spectrum method with the large deviations result due to Bernstein, we can derive the upper-bound on the redundancy of variable-rate SW coding given by He et al.