The Complete Affine Automorphism Group of Polar Codes

Recently, a permutation-based successive cancellation (PSC) decoding framework for polar codes attaches 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 trasformations.

[1]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[2]  Kai Chen,et al.  CRC-Aided Decoding of Polar Codes , 2012, IEEE Communications Letters.

[3]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[4]  Mikhail Kamenev,et al.  Permutation Decoding of Polar Codes , 2019, 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).

[5]  Stephan ten Brink,et al.  On the Automorphism Group of Polar Codes , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[6]  Kirill Ivanov,et al.  Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[7]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[8]  Ahmed Elkelesh,et al.  Belief Propagation List Decoding of Polar Codes , 2018, IEEE Communications Letters.

[9]  Peter Trifonov,et al.  Efficient Design and Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

[10]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[11]  S. Brink,et al.  Automorphism Ensemble Decoding of Reed–Muller Codes , 2020, IEEE Transactions on Communications.

[12]  Vera Miloslavskaya,et al.  Polar Subcodes , 2015, IEEE Journal on Selected Areas in Communications.

[13]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.

[14]  Ayoub Otmani,et al.  Algebraic properties of polar codes from a new polynomial formalism , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[15]  Mikhail Kamenev,et al.  A New Permutation Decoding Method for Reed-Muller Codes , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[16]  Jun Wang,et al.  Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[17]  Valerio Bioglio,et al.  Polar Codes for Automorphism Ensemble Decoding , 2021, 2021 IEEE Information Theory Workshop (ITW).

[18]  Rong Li,et al.  Analysis and Application of Permuted Polar Codes , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[19]  Christian Schürch,et al.  A partial order for the synthesized channels of a polar code , 2016, ISIT.

[20]  Rong Li,et al.  Parity-Check Polar Coding for 5G and Beyond , 2018, 2018 IEEE International Conference on Communications (ICC).