Finite-Blocklength Schemes in Information Theory (2/3)
Presenter(s)
Department of Information Engineering, The Chinese University of Hong Kong
2021 Croucher Summer Course in Information Theory, The Chinese University of Hong Kong
Lecture
Date
Abstract
While asymptotic coding theorems in information theory have the benefit of simplicity, they are not suitable for practical delay-constrained communication settings. We will discuss finite-blocklength schemes that take delay constraints into account. Settings such as channel coding, compression, joint source-channel coding and channels with state will be investigated.
Biography
Cheuk Ting Li received the B.Sc. degree in mathematics and B.Eng. degree in information engineering from The Chinese University of Hong Kong in 2012, and the M.S. and Ph.D. degree in electrical engineering from Stanford University in 2014 and 2018 respectively. He was a postdoctoral scholar at the Department of Electrical Engineering and Computer Sciences, University of California, Berkeley. He was awarded the 2016 IEEE Jack Keil Wolf ISIT Student Paper Award. He joined the Department of Information Engineering, the Chinese University of Hong Kong in January 2020. He is interested in developing new information-theoretic techniques to address problems in delay-constrained communications, information security, distributed computing and machine learning.Additional links
Related Videos
