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
ITW 2007
Conference paper
On the duality and difference between slepian-wolf coding and channel coding
Abstract
The duality between the sphere packing exponents, random coding exponents, and correct decoding exponents for Slepian-Wolf coding and channel coding is established. A systematic analysis and comparison of the expurgated exponents for Slepian-Wolf coding and channel coding is provided. This analysis, in conjunction with the linear codebook-level duality between Slepian-Wolf coding and channel coding, reveals that nonlinear Slepian-Wolf codes can strictly outperform linear Slepian-Wolf codes in terms of rate-error tradeoff at high rates. © 2007 IEEE.