Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 54 min ago
PreprintarXiv licencearXiv

Exact Second-Order Asymptotics for the Discrete Wyner--Ziv Problem

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$.

Related

  1. Exact Second-Order Asymptotics for the Gaussian Gray--Wyner Problem
    Lin Zhou, Lei Yu
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Exact Second-Order Asymptotics for the Wyner--Ahlswede--Körner Problem
    Daming Cao
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Exact Second-Order Asymptotics for Covert Communication over DMCs with Variational Distance Constraints
    Qiaosheng Zhang, Lin Zhou, Xuelong Li
    arXivPreprintCC0Full textGeneral mathematicsarXiv
  4. Second-order PACF asymptotics and discrimination between fractional Gaussian noise and FARIMA(0,d,0)
    Chunhao Cai
    arXivPreprintarXiv licenceFull textProbabilityStatisticsarXiv
  5. Exact Asymptotics for the 2D Euclidean Random Matching Problem
    Michael Goldman, Victor Armegioiu, Francesco Grotto +1
    HALPreprintCC BY 4.0Full textAnalysis & PDEsHAL
BibTeX
@misc{zhou2026exact,
  title = {{Exact Second-Order Asymptotics for the Discrete Wyner--Ziv Problem}},
  author = {Lin Zhou},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.11998},
  eprint = {2610.11998},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.11998},
}
RIS
TY  - UNPB
TI  - Exact Second-Order Asymptotics for the Discrete Wyner--Ziv Problem
AU  - Lin Zhou
PY  - 2026
DA  - 2026/10/08
PB  - arXiv
DO  - 10.48550/arxiv.2610.11998
UR  - https://arxiv.org/abs/2610.11998
AB  - 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$.
ER  -