Lossless source coding with polar codes

In this paper lossless compression with polar codes is considered. A polar encoding algorithm is developed and a method to design the code and compute the average compression rate for finite lengths is given. It is shown that the scheme achieves the optimal compression rate asymptotically. Furthermore, the proposed scheme has a very good performance at finite lengths. Both the encoding and decoding operations can be accomplished with complexity O(N log N) where N denotes the length of the code.

[1]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[2]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[3]  Ryuhei Mori,et al.  Performance and construction of polar codes on symmetric binary-input memoryless channels , 2009, 2009 IEEE International Symposium on Information Theory.

[4]  R. Urbanke,et al.  Polar codes are optimal for lossy source coding , 2009 .

[5]  S. Shamai,et al.  Lossless data compression with error correcting codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[7]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[8]  Rüdiger L. Urbanke,et al.  Polar Codes: Characterization of Exponent, Bounds, and Constructions , 2010, IEEE Transactions on Information Theory.

[9]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.