CRC-Polar-Inspired PAC Codes: Enumeration and Minimum-Weight Codeword Pruning
Abstract
Cyclic redundancy check-aided polar (CRC-polar) codes with successive cancellation list (SCL) decoding are widely recognized for their competitive error correction performance. This paper investigates the minimum-weight codewords (MWCs) in CRC-polar codes, analyzes how CRC constraints eliminate these codewords, and identifies $1.5\mathrm {w}_{\min }$ -weight codewords that can persist due to combinations of MWCs in polar codes. An enumeration algorithm is proposed to count MWCs in CRC-polar codes. To avoid tailoring the rate profile for various code lengths and code rates, we introduce profile-shifted PAC (PS-PAC) codes by applying a fixed shift to the rate profile, enabling the use of high-index constraint-dependent bits that effectively eliminate a large number of MWCs. The results demonstrate a significant improvement in error performance across a wide range of code lengths and code rates, achieving up to a 0.5 dB power gain for short PS-PAC codes. Additionally, we present continuous CRC-polar (CCRC-polar) codes, which embed intermediate CRC remainders into frozen coordinates throughout the precoding processes. This continuous masking introduces additional parity constraints that improve performance for medium-length codes, achieving power gains up to 0.12 dB.