On the Second-Order Achievabilities of Indirect Quadratic Lossy Source Coding
Huiyuan Yang, Xiaojun Yuan

TL;DR
This paper derives second-order achievability bounds for indirect quadratic lossy source coding, considering specific source models with bounded functions and moments, extending to cases with joint reconstruction of hidden and observable sources.
Contribution
It introduces new second-order bounds for indirect quadratic lossy source coding under specific source models, generalizing previous finite-alphabet results.
Findings
Established second-order achievability bounds using distortion-tilted information.
Generalized bounds to joint reconstruction of hidden and observable sources.
Bounds are consistent with finite-alphabet counterparts and are second-order tight.
Abstract
This paper studies the second-order achievabilities of indirect quadratic lossy source coding for a specific class of source models, where the term "quadratic" denotes that the reconstruction fidelity of the hidden source is quantified by a squared error distortion measure. Specifically, it is assumed that the hidden source can be expressed as , where is the observable source with alphabet , is a deterministic function, and is a random variable independent of , satisfying , , , and . Additionally, both the set and the reconstruction alphabet for are assumed to be bounded. Under the above settings, a second-order achievability bound is established using techniques based on distortion-tilted…
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 · Advanced Wireless Communication Techniques · Error Correcting Code Techniques
