IEEE International Symposium on Information Theory - Proceedings
899 - 903
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28557
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 binary alphabets. Extension of results to non-binary alphabets is discussed briefly. © 2010 IEEE.
- Work in Progress 654
Showing items related by title, author, creator and subject.
Arikan, E. (2012)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.
Çaycı, Semih (Bilkent University, 2013)In this study, lossless polar compression schemes are proposed for finite source alphabets in the noiseless setting. In the first part, lossless polar source coding scheme for binary memoryless sources introduced by ...
Önay, Saygun (Bilkent University, 2014)Polar codes were invented by Arıkan as the first “capacity achieving” codes for binary-input discrete memoryless symmetric channels with low encoding and decoding complexity. The “polarization phenomenon”, which is the ...