We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number, and the asymptotically minimum average length rate of the uniform random numbers, called the (variable-length) resolvability, is investigated. We first analyze the variable-length resolvability with the variational d...

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper’s channel, we consider resolvability-based constructions, which associate to each message...

This paper presents a new sensor placement measure called resolvability. This measure provides a technique for estimating the relative ability of various sensor systems, including single camera systems, stereo pairs, multi-baseline stereo systems, and 3D rangefinders, to accurately control visually manipulated objects. The measure also indicates the capability of a visual sensor to provide spat...

Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates. Establishing a conceptually simple converse proof for resolvability over the memoryless MAC, which rel...

This paper introduces a sensor placement measure called resolvability. The measure provides a technique for estimating the relative ability of various visual sensors, including monocular systems, stereo pairs, multi-baseline stereo systems, and 3D rangefinders, to accurately control visually manipulated objects. The resolvability ellipsoid illustrates the directional nature of resolvability, an...

In the problem of variable-length δ-channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the variational distance between the target and approximated distributions should be within a given constant δ asymptotically. In this paper, we assume that the given channel input is a mixed source whose components may be ge...

We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to simpler source resolvability. Specifically, we propose a MAC relies on combination codes, used in black-box manner, and leverages randomness recycling implemented via distributed hashing block-Markov coding. Since explicit codes are known, our results also yield first coding schemes a...