Extended polar codes perform better in terms of compound rate and scaling behavior

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. However, in terms of some practical aspects, these codes do not perform optimally and need further improvement. In this paper, we consider two such aspects: universality and finite-length scaling. We argue analytically that for extensions of polar codes that are based on £×£ matrices, these aspects become optimal as £ grows large.