2000 character limit reached
On Pre-transformed Polar Codes (1912.06359v1)
Published 13 Dec 2019 in cs.IT and math.IT
Abstract: 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.