Strong Converse Exponent for Remote Lossy Source Coding
Han Wu, Hamdi Joudeh

TL;DR
This paper investigates the exponential rate at which the probability of exceeding a distortion threshold approaches certainty in remote lossy source coding, providing bounds that unify and extend previous results.
Contribution
It establishes the strong converse exponent for remote lossy source coding, offering matched bounds and connecting to prior findings in related areas.
Findings
Derived the strong converse exponent with matching bounds
Unified previous results on lossy source coding and biometric authentication
Enhanced understanding of error probability convergence in source coding
Abstract
Past works on remote lossy source coding studied the rate under average distortion and the error exponent of excess distortion probability. In this work, we look into how fast the excess distortion probability converges to 1 at small rates, also known as exponential strong converse. We characterize its exponent by establishing matched upper and lower bounds. From the exponent, we also recover two previous results on lossy source coding and biometric authentication.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Wireless Communication Security Techniques · Advanced Data Compression Techniques
