We introduce the problem of variable-length (VL) source resolvability, in which a given target probability distribution is approximated by encoding a VL uniform random number, and the asymptotically minimum average length rate of the uniform random number, called the VL resolvability, is investigated. We first analyze the VL resolvability with the variational distance as an approximation measure. Next, we investigate the case under the divergence as an approximation measure. When the asymptotically exact approximation is required, it is shown that the resolvability under two kinds of approximation measures coincides. We then extend the analysis to the case of channel resolvability, where the target distribution is the output distribution via a general channel due to a fixed general source as an input. The obtained characterization of channel resolvability is fully general in the sense that, when the channel is just an identity mapping, it reduces to general formulas for source resolvability. We also analyze the second-order VL resolvability.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606717PMC
http://dx.doi.org/10.3390/e25101466DOI Listing

Publication Analysis

Top Keywords

resolvability
8
source resolvability
8
resolvability target
8
uniform random
8
random number
8
approximation measure
8
channel resolvability
8
general
5
variable-length resolvability
4
resolvability general
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!