Polar coding for the Slepian-Wolf problem based on monotone chain rules

Abstract

We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions.