On Weight Enumeration and Structure Characterization of Polar Codes via Group Actions
By: Vlad-Florin Dragoi, Mohammad Rowshan
Potential Business Impact:
Makes computer codes stronger for sending messages.
In this article, we provide a complete characterization of codewords in polar codes with weights less than twice the minimum distance, using the group action of the lower triangular affine (LTA) group. We derive a closed-form formula for the enumeration of such codewords. Furthermore, we introduce an enhanced partial order based on weight contributions, offering refined tools for code design. Our results extend previous work on Type II codewords to a full description of Type I codewords and offer new insights into the algebraic structure underlying decreasing monomial codes, including polar and Reed-Muller codes.
Similar Papers
Towards Weight Distribution-Aware Polar Codes
Information Theory
Makes wireless signals stronger and more reliable.
Enumeration of minimum weight codewords of affine Cartesian codes
Information Theory
Makes codes better at fixing mistakes in data.
Weight distribution of a class of $p$-ary codes
Cryptography and Security
Makes secret codes that are harder to break.