A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes
Zhichao Liu, Zhiming Ma, Guiying Yan

TL;DR
This paper introduces an algebraic method leveraging group theory to significantly reduce the computational complexity of determining the complete weight distribution of polar codes, which is vital for their performance analysis.
Contribution
It defines a new subgroup within the lower-triangular affine group to identify more cosets with identical weight distributions, improving computational efficiency.
Findings
Complexity reduction exceeds several times in most cases.
The algebraic structure enables transitive group action on coset sets.
Enhanced method over previous approaches.
Abstract
The code spectrum of polar codes is crucial to the performance of polar codes. Based on the lower-triangular affine group (LTA) of decreasing monomial codes and the one-variable descendance (ovd) relation, we define a new subgroup of LTA which can find more cosets with the same weight distribution. Using this algebraic structure, we further reduce the complexity by proofing the group action on a coset set is transitive. Our method is an enhanced version of previous research, and the complexity of most cases can be reduced exceeding several times.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRadiation Effects in Electronics · Error Correcting Code Techniques · Coding theory and cryptography
