Zihan Zhang
The Ohio State University
Title
Combinatorics in Error-Correcting Codes: List Decodability of Reed–Solomon Codes
Abstract
This talk will introduce some key concepts and foundational goals in the theory of error-correcting codes, a crucial area in information theory, communications, and cryptography. We will begin by quickly outlining fundamental principles in coding theory. Then, our focus will then shift to the combinatorial problem of list decoding, specifically in the context of Reed–Solomon (RS) codes. We will survey some most recent breakthroughs in understanding the optimal combinatorial list decodability of RS codes. This talk is designed for both newcomers and experts in the field, offering an up-to-date perspective on one of the most actively researched areas in coding theory.
