IDSS Special Seminars Yury Polyanskiy
Topics in Information and Inference Seminar
Title: Strong data processing inequalities and information percolation Abstract: The data-processing inequality, that is, $I(U;Y) \le I(U;X)$ for a Markov chain $U \to X \to Y$, has been the method of choice for proving impossibility (converse) results in information theory and many other disciplines. A channel-dependent improvement is called the strong data-processing inequality (or SDPI).…



