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.
['Remi A. Chou', 'Matthieu R. Bloch']
Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes