A new source-splitting approach to the slepian-wolf problem

It is shown that achieving an arbitrary rate-point in the achievable region of the M-source Slepian-Wolf (Ref.1) problem may be reduced via a practical source-splitting transformation to achieving a corner point in a 2M-1 source Slepian-Wolf problem. Moreover, each source must be split at most once. This approach extends the ideas introduced in (B. Rimoldi et al., 1997) to a practical setting: it does not require common randomness shared between splitters and the decoders, the cardinality of each source split is strictly smaller than the original, and practical iterative decoding methods can achieve rates near the theoretical bound