Computing the Low-Weight codewords of Punctured and Shortened Pre-Transformed polar Codes
Authors:
Preprint
Abstract
In this paper, we present a deterministic algorithm to count the low-weight codewords of punctured and shortened pure and pre-transformed polar codes. The method first evaluates the weight properties of punctured/shortened polar cosets. Then, a method that discards the cosets that have no impact on the computation of the low-weight codewords is introduced. A key advantage of this method is its applicability, regardless of the frozen bit set, puncturing/shortening pattern, or pretransformation. Results confirm the method's efficiency while showing reduced computational complexity compared to stateof-the-art algorithms.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- On the Closed-Form Weight Enumeration of Polar Codes: 1.5d -Weight CodewordsIEEE Transactions on Communications, 2024
- On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its ApplicationsIEEE Transactions on Information Theory, 2023
- Computing the Partial Weight Distribution of Punctured, Shortened, Precoded Polar CodesIEEE Transactions on Communications, 2022
- A Novel Puncturing Scheme for Polar CodesIEEE Communications Letters, 2014
- An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy CheckIEEE Communications Letters, 2012
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009