On Pre-transformed Polar Codes

12/13/2019
by   Bin Li, et al.
0

In this paper, we prove that any pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and convolution code (CC) matrix) does not reduce the code minimum distance and an properly designed pre-transformation can reduce the number of codewords with the minimum distance. This explains that the pre-transformed polar codes can perform better than the Polar/RM codes.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset