CCSP Seminar: Hamed Hassani, " Non-Asymptotic Analysis of Codes and its Practical Significance"
Communication, Control and Signal Processing Seminar
In this talk, I will consider a practically significant question that has emerged in recent years as the new grand challenge in coding theory: Design practical codes that are optimal in the non-asymptotic sense (at short lengths). In the first part of the lecture (in slides), I will explain why the performance of the state-of-the-art code designs are unsatisfactory with respect to this challenge. In the second part (on the board), I will discuss why Reed-Muller codes, which are among the oldest code designs but recently revisited, can be a promising candidate for short packet communication.