Performance of binary polar codes with high- dimensional kernel 1
Vera Miloslavskaya, Peter Trifonov · 2011
Upper union bound for the decoding error probability of polar codes with arbitrary binary kernels under the successive cancellation decoding is derived. The proposed approach is based on the representation of polar codes as multilevel ones.