CCSP Seminar: Hamed Hassani, " Non-Asymptotic Analysis of Codes and its Practical Significance"

Thursday, March 29, 2018
5:00 p.m.-6:30 p.m.
2168 AV Williams
Ajaykrishnan Nageswaran
301 405 3661
ajayk@umd.edu

Communication, Control and Signal Processing Seminar


AbstractSince Shannon's 1948 landmark paper, coding theory has focused on achieving capacity in the asymptotic sense: design low-complexity codes that become reliable at rates approaching capacity in the limit of large blocklengths. Throughout the seven decades of the development of coding theory, we have witnessed many remarkable code designs. Today, we have two families of low-complexity codes that can asymptotically achieve the capacity for a wide range of channels: polar codes and spatially coupled codes. 

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.

Audience: Graduate  Faculty  Post-Docs 

remind we with google calendar

 

March 2024

SU MO TU WE TH FR SA
25 26 27 28 29 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6
Submit an Event