A&C Seminar: Zeyu Guo - Combinatorial List Decodability of Random Reed–Solomon Codes and Beyond

Описание к видео A&C Seminar: Zeyu Guo - Combinatorial List Decodability of Random Reed–Solomon Codes and Beyond

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.

Комментарии

Информация по комментариям в разработке

Похожие видео