|| On the Weight Spectrum of Pre-transformed Polar Codes
||Yuan Li, Huawei Technologies Company Limited,University of Chinese Academy of Sciences,Academy of Mathematics and Systems Science,Chinese Academy of Sciences, China; Huazi Zhang, Rong Li, Jun Wang, Huawei Technologies Company Limited, China; Guiying Yan, Zhiming Ma, University of Chinese Academy of Sciences,Academy of Mathematics and Systems Science,Chinese Academy of Sciences, China|
||D3-S4-T2: Polar Codes I
||Wednesday, 14 July, 23:00 - 23:20
||Wednesday, 14 July, 23:20 - 23:40
Polar codes are the first class of channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels (B-DMC) with efficient encoding and decoding algorithms. But the weight spectrum of polar codes is relatively poor compared to Reed-Muller (RM) codes, which degrades their maximum-likehood (ML) performance. Pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and polarization-adjusted convolutional (PAC) codes), improves weight spectrum while retaining polarization. In this paper, the weight spectrum of upper-triangular pre-transformed polar codes is mathematically analyzed. In particular, we focus on calculating the number of low-weight codewords due to their impact on error-correction performance. Simulation results verify the accuracy of the analysis.