Polar coding for the Slepian-Wolf problem based on monotone chain rules
Date
2012
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
2012 IEEE International Symposium on Information Theory Proceedings
Print ISSN
2157-8117
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
566 - 570
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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. © 2012 IEEE.