On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications
Top Cited Papers
- 25 September 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (12) , 7627-7649
Abstract
Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can then be used as a foundation for two applications. In the first application, we obtain a lower bound for the number of minimum-weight codewords (a.k.a. the error coefficient), which matches the exact number established previously in the literature. In the second application, we derive a novel method that modifies the information set (a.k.a. rate profile) of polar codes and PAC codes in order to reduce the error coefficient, hence improving their performance. More specifically, by analyzing the structure of minimum-weight codewords of polar codes (as special sums of the rows in the polar transform matrix), we can identify rows (corresponding to information bits) that contribute the most to the formation of such codewords and then replace them with other rows (corresponding to frozen bits) that bring in few minimum-weight codewords. A similar process can also be applied to PAC codes. Our approach deviates from the traditional constructions of polar codes, which mostly focus on the reliability of the sub-channels, by taking into account another important factor - the weight distribution. Extensive numerical results show that the modified codes outperform PAC codes and CRC-Polar codes at the practical block error rate of 10 -2 -10 -3 .Keywords
All Related Versions
Funding Information
- Australian Research Council (ARC) through Discovery Project ARC (DP200100731)
- Discovery Early Career Researcher Award (DECRA) project (DE180100768)
- Monash University during the Ph.D. Program
This publication has 32 references indexed in Scilit:
- An Enhanced Probabilistic Computation Method for the Weight Distribution of Polar CodesIEEE Communications Letters, 2017
- A randomized construction of polar subcodes2017
- Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic ApproximationsIEEE Transactions on Information Theory, 2016
- A partial order for the synthesized channels of a polar code2016
- Algebraic properties of polar codes from a new polynomial formalism2016
- List Decoding of Polar CodesIEEE Transactions on Information Theory, 2015
- An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy CheckIEEE Communications Letters, 2012
- Efficient Design and Decoding of Polar CodesIEEE Transactions on Communications, 2012
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximationIEEE Transactions on Information Theory, 2001
- Weight distribution for closest coset decoding of |u|u+v| constructed codesIEEE Transactions on Information Theory, 1997