Hi all,
Tomorrow our visitor Michèle Wigger will tell us about "Strong and $\epsilon$-Dependent Converses for Classical Coding and Hypothesis Testing Problems". See below for the abstract. The talk will take place at 2pm in HIT E 41.1 or on Zoom: https://ethz.zoom.us/j/362994444.
Best, Ladina
%%%%%%%%%%%
Title: "Strong and $\epsilon$-Dependent Converses for Classical Coding and Hypothesis Testing Problems"
Abstract: This is a classical talk, where I will be presenting new simple strong converse proofs for basic classical source coding and hypothesis testing problems, and if time permits also for classical channel coding. For the basic source and channel coding setups, the proofs only use a change of measure argument on the strongly typical set and the asymptotic analysis of the new measure. This proof method is also extended to a source coding setup under relaxed expected rate constraints, in which case the minimum compression rate depends on the allowed probability of error $\epsilon$ and an $\epsilon$-dependent converse is required. In the second part of the talk we present converse proof methods for hypothesis testing setups, where the change of measure argument is not sufficient, but has to be completed with proofs of asymptotic Markov Chains. We again also consider expected resource or secrecy constraints and provide probability-of-error-dependent converse proofs under these expected constraints.