Exponential Strong Converse for Content Identification With Lossy Recovery

DOI10.1109/TIT.2018.2842775MaRDI QIDQ4682883zbMATH OpenOpenAlexWikidataFDO

Authors Lin Zhou, Vincent Y. F. Tan, Lei Yu, Mehul Motani

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.06649

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: We revisit the high-dimensional content identification with lossy recovery problem (Tuncel and G"und"uz, 2014) and establish an exponential strong converse theorem. As a corollary of the exponential strong converse theorem, we derive an upper bound on the joint identification-error and excess-distortion exponent for the problem. Our main results can be specialized to the biometrical identification problem~(Willems, 2003) and the content identification problem~(Tuncel, 2009) since these two problems are both special cases of the content identification with lossy recovery problem. We leverage the information spectrum method introduced by Oohama and adapt the strong converse techniques therein to be applicable to the problem at hand.

Cited in

(2)

• Identification and Lossy Reconstruction in Noisy Databases
• Twenty questions with random error

This page was built for publication: Exponential Strong Converse for Content Identification With Lossy Recovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682883)