This self-contained tutorial presents a unified treatment of single- and multi-user problems in Shannon s information theory considering in particular the cases that depart from the requirement that the error probability decays asymptotically in the blocklength. Instead, the error probabilities for various problems are bounded above by a non-vanishing constant and the spotlight is shone on achievable coding rates as functions of the growing blocklengths. This represents the study of asymptotic estimates with non-vanishing error probabilities. Divided into three parts, the monograph begins...
This self-contained tutorial presents a unified treatment of single- and multi-user problems in Shannon s information theory considering in particular...