Improving the Error Coefficient of Polar Codes

Polar codes are normally constructed based on the reliability of the sub-channels in the polarized vector channel. Code construction based on reliability is compatible with successive cancellation decoding. However, due to poor Hamming distance properties, the designed codes cannot perform well with near maximum likelihood decoders. In this work, we propose a new approach that modifies polar codes and PAC codes to significantly lower the number of codewords with minimum distance (a.k.a. error coefficient). This approach is based on the recognition of all the rows of polar transform involved in the formation of the minimum-weight codewords. The numerical results show that the designed codes outperform polar codes and PAC codes under list decoding.

[1]  Emanuele Viterbo,et al.  On the Formation of Min-weight Codewords of Polar/PAC Codes and Its Applications , 2021, 2111.08843.

[2]  H. Pfister,et al.  An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design , 2021, IEEE Transactions on Information Theory.

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

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

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

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

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

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

[9]  Tobias Prinz,et al.  Polar Code Construction for List Decoding , 2017, ArXiv.

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

[11]  Rüdiger L. Urbanke,et al.  Construction of polar codes with sublinear complexity , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

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

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

[14]  Tomaso Erseghe,et al.  Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations , 2015, IEEE Transactions on Information Theory.

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

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

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

[18]  S. Verdú,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

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

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

[21]  Shu Lin,et al.  Error control coding , 2004 .