The Fractality of Polar and Reed–Muller Codes †

The generator matrices of polar codes and Reed–Muller codes are submatrices of the Kronecker product of a lower-triangular binary square matrix. For polar codes, the submatrix is generated by selecting rows according to their Bhattacharyya parameter, which is related to the error probability of sequential decoding. For Reed–Muller codes, the submatrix is generated by selecting rows according to their Hamming weight. In this work, we investigate the properties of the index sets selecting those rows, in the limit as the blocklength tends to infinity. We compute the Lebesgue measure and the Hausdorff dimension of these sets. We furthermore show that these sets are finely structured and self-similar in a well-defined sense, i.e., they have properties that are common to fractals.

[1]  Lauwerens Kuipers,et al.  Uniform distribution of sequences , 1974 .

[2]  Emanuele Viterbo,et al.  Folded tree maximum-likelihood decoder for Kronecker product-based codes , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  Rüdiger L. Urbanke,et al.  Polar Codes are Optimal for Lossy Source Coding , 2009, IEEE Transactions on Information Theory.

[4]  Jean-Marie Goethals,et al.  On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..

[5]  M. Rao.  Measure Theory and Integration , 2018 .

[6]  O. Gaans.  Probability measures on metric spaces , 2022 .

[7]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[8]  Rajai Nasser.  Ergodic Theory Meets Polarization. I: An Ergodic Theory for Binary Operations , 2014, ArXiv.

[9]  Rajai Nasser.  An Ergodic Theory of Binary Operations—Part II: Applications to Polarization , 2017, IEEE Transactions on Information Theory.

[10]  Rüdiger L. Urbanke,et al.  The compound capacity of polar codes , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Saeid Haghighatshoar,et al.  Polarization of the Rényi Information Dimension With Applications to Compressed Sensing , 2013, IEEE Transactions on Information Theory.

[12]  H. Eggleston.  The fractional dimension of a set defined by decimal properties , 1949 .

[13]  V. Rich.  Personal communication , 1989, Nature.

[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]  K. Falconer.  Fractal Geometry Mathematical Foundations and Applications Third , 2013 .

[16]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[17]  Tadao Kasami,et al.  New generalizations of the Reed-Muller codes-I: Primitive codes , 1968, IEEE Trans. Inf. Theory.

[18]  E. Arkan,et al.  A performance comparison of polar codes and Reed-Muller codes , 2008, IEEE Communications Letters.

[19]  Emmanuel Abbe,et al.  High-Girth matrices and polarization , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[20]  Rajai Nasser.  An Ergodic Theory of Binary Operations—Part I: Key Properties , 2016, IEEE Transactions on Information Theory.

[21]  Mine Alsan.  A novel partial order for the information sets of polar codes over B-DMCs , 2014, 2014 IEEE International Symposium on Information Theory.

[22]  W. Rudin.  Real and complex analysis, 3rd ed. , 1987 .

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

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

[25]  Sergio Albeverio,et al.  Topological and fractal properties of real numbers which are not normal , 2005 .

[26]  R. Cooke.  Real and Complex Analysis , 2011 .

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

[28]  Jungwon Lee,et al.  Relaxed channel polarization for reduced complexity polar coding , 2015, 2015 IEEE Wireless Communications and Networking Conference (WCNC).

[29]  Rüdiger L. Urbanke,et al.  Finite-Length Scaling for Polar Codes , 2013, IEEE Transactions on Information Theory.

[30]  Jungwon Lee,et al.  Relaxed Polar Codes , 2017, IEEE Transactions on Information Theory.

[31]  Eren Sasoglu,et al.  Polarization and Polar Codes , 2012, Found. Trends Commun. Inf. Theory.