Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.17872 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914985872982016 |
|---|---|
| author | Liu, Zhichao Ma, Zhiming Yan, Guiying |
| author_facet | Liu, Zhichao Ma, Zhiming Yan, Guiying |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_17872 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes Liu, Zhichao Ma, Zhiming Yan, Guiying Information Theory 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. |
| title | A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2410.17872 |