Paper Info
Title
The Complete Affine Automorphism Group of Polar Codes
Abstract
Recently, a permutation-based successive cancellation (PSC) decoding framework for polar codes attracts much attention. It decodes several permuted codewords with independent successive cancellation (SC) decoders. Its latency thus can be reduced to that of SC decoding. However, the PSC framework is ineffective for permutations falling into the lower-triangular affine (LTA) automorphism group, as they are invariant under SC decoding. As such, a larger block lower-triangular affine (BLTA) group that contains SC-variant permutations was discovered for decreasing polar codes. But it was unknown whether BLTA equals the complete automorphism group. In this paper, we prove that BLTA equals the complete automorphisms of decreasing polar codes that can be formulated as affine transformations.
Year
DOI
Venue
2021
10.1109/GLOBECOM46510.2021.9685181
2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)
Keywords
DocType
ISSN
Polar codes, decreasing monomial codes, automorphism group, permutation decoding
Conference
2334-0983
Citations 
PageRank 
References 
0
0.34
0
Authors
7
Name
Order
Citations
PageRank
Yuan Li101.01
Huazi Zhang228924.91
Rong Li33117.93
Jun Wang49228736.82
Tong, W.562.92
Guiying Yan6111.63
Zhi-Ming Ma722718.26