Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes

We show how to replace some of the randomized decisions in the encoding and decoding of polar codes by deterministic decisions. Specifically, we prove that random decisions on low-entropy bits may be replaced by an argmax decision without any loss of performance. We illustrate the usefulness of this result in the case of polar coding for the Wyner-Ziv problem and for channel coding.

[1]  Junya Honda,et al.  Polar Coding Without Alphabet Extension for Asymmetric Models , 2013, IEEE Transactions on Information Theory.

[2]  Erdal Arikan,et al.  Source polarization , 2010, 2010 IEEE International Symposium on Information Theory.

[3]  Jörg Kliewer,et al.  Polar coding for empirical and strong coordination via distribution approximation , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[4]  Remi A. Chou,et al.  Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy , 2016, IEEE Transactions on Information Theory.

[5]  Masahito Hayashi,et al.  Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness , 2005, IEEE Transactions on Information Theory.

[6]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[7]  Rüdiger L. Urbanke,et al.  Polar Codes are Optimal for Lossy Source Coding , 2009, IEEE Transactions on Information Theory.

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[9]  Rüdiger L. Urbanke,et al.  How to achieve the capacity of asymmetric channels , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[11]  Remi A. Chou,et al.  Polar coding for secret-key generation , 2013, 2013 IEEE Information Theory Workshop (ITW).

[12]  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.

[13]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .