The Fractality of Polar and Reed–Muller Codes

• Main Author: Bernhard C. Geiger
• Format: Article
• Language: English
• Published: MDPI AG 2018-01-01
• Series: Entropy
• Subjects: polar codes; Reed–Muller codes; fractals; self-similarity
• Online Access: http://www.mdpi.com/1099-4300/20/1/70

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.