Polar codes, invented by Arikan, with low encoding and decoding complexity. But the minimum distance of polar codes is not great. The normalized minimum distance goes to $0$ with the block size. Yet, the existing decoding algorithms for polar codes can asymptotically achieve channel capacity.
Generally, a code with minimum distance $d$ can correct $\frac{d-1}{2}$ errors (random errors). And Polar code is also error-correcting code, I was wondering how many errors can it correct( e.g. A $[2048, 614]$ with $BEC(0.19)$ polar code.)? Much appreciated.