Efficient Partial Orders for Polar Codes on Binary Memoryless Symmetric Channels

This paper introduces new partial orders for polar codes based on the Bhattacharyya parameter and bit-error probability, which are more computationally efficient than the existing partial orders based on channel degradation. The authors leverage the properties of polarization transformation in the Binary Erasure Channel to derive these new partial orders for arbitrary Binary Memoryless Symmetric Channels.