Seminar • Algorithms and Complexity • Combinatorial List Decodability of Random Reed–Solomon Codes and Beyond

Please note: This seminar will take place in DC 2568 and online.

Zeyu Guo, Assistant Professor
Department of Computer Science and Engineering, Ohio State University

A code C ⊆ A^n over an alphabet A is said to be (r, L)-combinatorially list decodable if any Hamming ball of radius r n in A^n contains at most L codewords from C.

In this talk, I will discuss a recent line of research that has demonstrated the optimal combinatorial list decodability of random Reed–Solomon codes. Additionally, I will briefly touch on related progress concerning rank-metric codes and folded Reed–Solomon codes.

To attend this seminar is person, please go to DC 2568. You can also attend virtually on Zoom.