University of Cambridge > Talks.cam > Information Theory Seminar > Some combinatorial problems in information theory

  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

Some combinatorial problems in information theory

Download to your calendar using vCal

  • UserProf. Marco Dalai, University of Brescia Speaker website
  • ClockWednesday 24 April 2024, 14:00-15:00
  • HouseMR5, 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:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 9025.75387597 kWh Rooms SG1 & SG2, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT LR3A Engineering, Department of

Other talks

An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Title TBC Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge Thelocactus
 

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