Exponential Strong Converse for Content Identification With Lossy Recovery
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Information Theory"
DOI: 10.1109/isit.2017.8006664
Abstract: We revisit the high-dimensional content identification with lossy recovery problem (Tuncel and Gündüz, 2014) and establish an exponential strong converse theorem. As a corollary of the exponential strong converse theorem, we derive an upper bound… read more here.
Keywords: identification lossy; strong converse; content identification; identification ... See more keywords
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
Uncertainty in Identification Systems
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2020.3044974
Abstract: High-dimensional identification systems consisting of two groups of users in the presence of statistical uncertainties are considered in this work. The task is to design enrollment mappings to compress users’ information and an identification mapping… read more here.
Keywords: strong converse; identification systems; identification setting; identification ... See more keywords