OpenAlex ·
Exact Second-Order Asymptotics for the Discrete Wyner--Ziv Problem
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.11998
- Original
- Read it at the publisher
- Topics
Abstract
We revisit the discrete Wyner--Ziv problem and establish exact second-order asymptotics. Our main contribution is a second-order converse bound, which is derived using posterior decomposition, concentration inequalities, and a conditional Gaussian approximation for martingales. Furthermore, we extend the previous best known achievability result of Li and Li (arXiv 2025) by allowing the test channel to depend on the type of the observed source sequence. Exact second-order asymptotics are established by combining our achievability and converse bounds. In particular, we show that the achievability bound of Li and Li (arXiv 2025) is not optimal in general. Specifically, we provide two numerical examples to illustrate our results: a binary asymmetric source and a quaternary source. For the first example, the achievability bound of Li and Li (arXiv 2025) achieves the optimal second-order asymptotics. However, in the second example, we show that our achievability result is optimal, which reduces the second-order coding rate of Li and Li (arXiv 2025) by $10.77\%$ at the excess-distortion probability of $0.1$ and by $21.35\%$ at the excess-distortion probability of $0.2$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computer Vision
Energy-Aware Receiver-initiated MAC Protocol for Energy Harvesting IoT
Goal-Oriented Bundle Management and Flow Control for Deep-Space Communications via Reinforcement Learning
Digital Twin for Pre-Deployment Validation of AI-Driven Safety-Critical Industrial Edge Control Loops
Semantic Edge-Cloud Communication for Real-Time Urban Traffic Digital Twins
Secure Quantum Handshakes: Quantum Network Verification Via Simon's Algorithm
Get the few papers worth your time in Computer Vision every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.