On the Formation of Min-weight Codewords of Polar/PAC Codes and Its Applications

Polar codes are normally designed based on the reliability of the sub-channels in the polarized vector channel. There are various methods with diverse complexity and accuracy to evaluate the reliability of the sub-channels. However, designing polar codes solely based on the sub-channel reliability may result in poor Hamming distance properties. In this work, we propose a different approach to design the information set for polar codes and PAC codes where the objective is to reduce the number of codewords with minimum weight (a.k.a. error coefficient) of a code designed for maximum reliability. This approach is based on the coset-wise characterization of the rows of polar transform GN involved in the formation of the minimum-weight codewords. Our analysis capitalizes on the properties of the polar transform based on its row and column indices. The numerical results show that the designed codes outperform PAC codes and CRC-Polar codes at the practical block error rate of 10 − 10. Furthermore, a by-product of the combinatorial properties analyzed in this paper is an alternative enumeration method of the minimumweight codewords.

[1]  L. Litwin,et al.  Error control coding , 2001 .

[2]  Arman Fazeli,et al.  A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[3]  Erdal Arikan,et al.  From sequential decoding to channel polarization and back again , 2019, ArXiv.

[4]  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.

[5]  Wei Wu,et al.  Generalized partial orders for polar code bit-channels , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  Emanuele Viterbo,et al.  On Convolutional Precoding in PAC Codes , 2021, 2021 IEEE Globecom Workshops (GC Wkshps).

[7]  Vlad Dragoi,et al.  Algebraic approach for the study of algorithmic problems coming from cryptography and the theory of error correcting codes. (Approche algébrique pour l'étude et la résolution de problèmes algorithmiques issus de la cryptographie et de la théorie des codes ) , 2017 .

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

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

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

[11]  Marc P. C. Fossorier,et al.  Weight distribution for closest coset decoding of |u|u+v| constructed codes , 1997, IEEE Trans. Inf. Theory.

[12]  Ryuhei Mori,et al.  Performance and construction of polar codes on symmetric binary-input memoryless channels , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Henry D. Pfister,et al.  An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design , 2021, ArXiv.

[14]  Jiaqi Gu,et al.  On Pre-transformed Polar Codes , 2019, ArXiv.

[15]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[16]  Emanuele Viterbo,et al.  How to Modify Polar Codes for List Decoding , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

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

[18]  Peter Trifonov,et al.  A randomized construction of polar subcodes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[19]  Kai Chen,et al.  Distance spectrum analysis of polar codes , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[20]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[21]  Peter Trifonov,et al.  Randomized Polar Subcodes With Optimized Error Coefficient , 2020, IEEE Transactions on Communications.

[22]  Branka Vucetic,et al.  Design of Short Polar Codes for SCL Decoding , 2020, IEEE Transactions on Communications.

[23]  Nikita Polyanskii,et al.  Weight Distributions for Successive Cancellation Decoding of Polar Codes , 2020, IEEE Transactions on Communications.

[24]  Bin Li,et al.  An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check , 2012, IEEE Communications Letters.

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

[26]  Aijun Liu,et al.  An Enhanced Probabilistic Computation Method for the Weight Distribution of Polar Codes , 2017, IEEE Communications Letters.

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

[28]  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.

[29]  Mehrdad Valipour,et al.  On Probabilistic Weight Distribution of Polar Codes , 2013, IEEE Communications Letters.

[30]  Yi Hong,et al.  A Comparative Study of Polar Code Constructions for the AWGN Channel , 2015, ArXiv.

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

[32]  Emanuele Viterbo,et al.  Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding , 2020, ArXiv.