An empirical scaling law for polar codes
Satish Babu Korada, Andrea Montanari, Emre Telatar, Rudiger L. Urbanke · 2010
Using scaling laws, we obtain estimates of the block error probability of polar codes under successive cancellation decoding. For the binary erasure channel we present an upper and a lower bound for the scaling parameter. Numerically these two bounds match. We also present a scaling law for general binary discrete memoryless channels.