Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first …