Slepian-wolf coding for general sources and its duality with channel coding

We study the problem of Slepian-Wolf coding for general sources (not necessarily stationary) with finite alphabet. A linear codebook-level duality between Slepian-Wolf coding for general sources and channel coding for a class of cyclic-symmetric channels is established under optimal decoding, through which the general formula for the Slepian-Wolf limit can be reinterpreted using Verdú and Han's channel capacity formula. © 2007 IEEE.