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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The Fractality of Polar and Reed-Muller Codes

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

https://harvard.zoom.us/j/95307260045 EL.09, CMS Sociology Department Seminar Room, Free School Lane

Other talks

Title tbc Sera Markoff Inaugural Lecture for the Plumian Professorship in Astronomy and Experimental Philosophy - 'Staring into the heart of darkness: from theory to the direct imaging of black holes' Title to be confirmed Tea and Coffee Break Carrollian momenta from anti de Sitter Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity