Shannon Theory
S.11.3
Lecture
Renyi Entropy

Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Renyi Entropy

Ryo Nomura, Hideki Yagi

Date & Time

01:00 am – 01:00 am

Abstract

The source resolvability problem (or resolvability problem for short) is one of random number generation problems in information theory. In the literature, the optimum achievable rates in the resolvability problem have been characterized in different two ways. One is based on the information spectrum quantity and the other is based on the smooth Renyi entropy. Recently, Nomura has revealed the optimum achievable rate with respect to the f-divergence, which includes the variational distance, the Kullback-Leibler (KL) divergence and so on. On the other hand, the optimum achievable rates with respect to the variational distance has been characterized by using the smooth Renyi entropy. In this paper, we try to extend this result to the case of other distances. To do so, we consider the resolvability problem with respect to the subclass of f-divergences and determine the optimum achievable rate in terms of the smooth Renyi entropy. The subclass of f-divergences considered in this paper includes typical distance measures such as the total variational distance, the KL divergence, the Hellinger distance and so on.


Presenters

Ryo Nomura

Waseda University

Hideki Yagi

University of Electro-Communications

Session Chair

Ofer Shayevitz

Tel Aviv University