Strong Converse Using Change of Measure Arguments
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2019.2953877
Abstract: The strong converse for a coding theorem shows that the optimal asymptotic rate possible with vanishing error cannot be improved by allowing a fixed error. Building on a method introduced by Gu and Effros for… read more here.
Keywords: using change; strong converse; measure arguments; change measure ... See more keywords