Second-Order Achievable Rate Region of Slepian-Wolf Coding Problem in terms of Smooth Max-Entropy for General Sources

Abstract

This letter deals with the Slepian-Wolf coding problem for general sources. The second-order achievable rate region is derived using quantity which is related to the smooth max-entropy and the conditional smooth max-entropy. Moreover, we show the relationship of the functions which characterize the second-order achievable rate region in our study and previous study.