Some combinatorial problems in information theory

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

• Prof. Marco Dalai, University of Brescia
• Wednesday 24 April 2024, 14:00-15:00
• MR5, CMS Pavilion A.

If you have a question about this talk, please contact Prof. Ramji Venkataramanan.

Information theory has been a source of interesting combinatorial problems since its early days. In this talk I will give an overview of some such problems which have received renewed interest in recent years, mostly stemming from the study of optimal channel codes in the low rate regime and in the list decoding setting. I will present some recent results and some open problems.

This talk is part of the Information Theory Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Information Theory Seminar
• Interested Talks
• MR5, CMS Pavilion A
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.