一、报告题目

Zero-Rate List-Decodable Codes for the Z-channel

二、主讲人

Nikita Polyanskii

三、报告时间

2022年11月17日 15:00–16:30

四、报告地点

ZOOM

五、摘要

A Z-channel with error fraction $\tau$ takes as input a length-$n$ binary codeword and injects in an adversarial manner up to $n\tau$ asymmetric errors. It is known that the largest $(L-1)$-list-decodable code for the Z-channel with error fraction $\tau$ has exponential (in $n$) size if $\tau$ is less than a critical value, which is called the Plotkin point, and has constant size if $\tau$ is larger than the Plotkin point. In this talk, I will provide a size characterization of largest list-decodable codes $\epsilon$-above the Plotkin point for the Z-channel.

六、主讲人简介

Nikita Polyanskii received his M.Sc. in Mathematics and Ph.D. in Mathematics from Moscow State University in 2013 and 2016, respectively. Previously, he worked as a researcher at the Technical University of Munich, the Technion - Israel Institute of Technology, the Skolkovo Institute of Science and Technology, the Institute of Information Transmission Problems, and the Huawei Technologies Co. Ltd. Currently, Nikita is a research scientist at the IOTA Foundation. His research interests include blockchain, coding theory, combinatorics, and theoretical aspects of engineering.

七、主办单位

非线性期望前沿科学中心

数学与交叉科学研究中心