Finite-Blocklength Schemes in Information Theory (3/3)
2021 Croucher Summer Course in Information Theory, The Chinese University of Hong Kong
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.