About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
CWIT 2007
Conference paper
Slepian-wolf coding for general sources and its duality with channel coding
Abstract
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.