Polar coding for the Slepian-Wolf problem based on monotone chain rules
IEEE International Symposium on Information Theory - Proceedings
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28157
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. © 2012 IEEE.
- Conference Paper 
Showing items related by title, author, creator and subject.
Arikan, E. (2010)The notion of source polarization is introduced and investigated. This complements the earlier work on channel polarization. An application to Slepian-Wolf coding is also considered. The paper is restricted to the case of ...
Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels Arikan, E. (2009)A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity is the highest ...
Jayram T.S.; Arikan E. (Institute of Electrical and Electronics Engineers Inc., 2017)We give a unified treatment of some inequalities that are used in the proofs of channel polarization theorems involving a binary-input discrete memoryless channel. IEEE