University of Cambridge > > NEWCOM# Emerging Topics Workshop > The Fractality of Polar and Reed-Muller Codes

The Fractality of Polar and Reed-Muller Codes

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Jossy Sayir.

The generator matrices of polar codes and Reed-Muller codes are submatrices of a Kronecker product of a lower-triangular binary square matrix. These submatrices are chosen according to an index set pointing to rows, which for polar codes minimize the Bhattacharyya parameter, and which for Reed-Muller codes maximize the Hamming weight. This work investigates the properties of this index set in the infinite blocklength limit. In particular, the Lebesgue measure, the Hausdorff dimension, and the self-similarity of these sets will be discussed. It is shown that these index sets fulfill several properties which are common to fractals.

This talk is part of the NEWCOM# Emerging Topics Workshop series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2021, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity