TY - GEN

T1 - Source resolvability problem with respect to a certain subclass of f-divergence

AU - Nomura, Ryo

N1 - Funding Information:
ACKNOWLEDGMENT This work was supported in part by JSPS KAKENHI Grant Number JP18K04150.
Publisher Copyright:
© 2019 IEEE.

PY - 2019/7

Y1 - 2019/7

N2 - This paper deals with the source resolvability problem which is one of typical random number generation problems. In the literatures, the achievable rate in the source resolvability problem with respect to the variational distance as well as the Kullback-Leibler (KL) divergence have been analyzed. On the other hand, in this study we consider the problem with respect to a subclass of f-divergence. The f-divergence is a general non-negative measure between two probabilistic distributions and includes several important measures such as the variational distance, the KL divergence, the Hellinger distance and so on. Hence, it is meaningful to consider the source resolvability problem with respect to the f-divergence. We derive the general formula of the optimum achievable rate for a certain subclass of the f-divergence. Then, we reveal that it is easy to derive previous results from our general formula.

AB - This paper deals with the source resolvability problem which is one of typical random number generation problems. In the literatures, the achievable rate in the source resolvability problem with respect to the variational distance as well as the Kullback-Leibler (KL) divergence have been analyzed. On the other hand, in this study we consider the problem with respect to a subclass of f-divergence. The f-divergence is a general non-negative measure between two probabilistic distributions and includes several important measures such as the variational distance, the KL divergence, the Hellinger distance and so on. Hence, it is meaningful to consider the source resolvability problem with respect to the f-divergence. We derive the general formula of the optimum achievable rate for a certain subclass of the f-divergence. Then, we reveal that it is easy to derive previous results from our general formula.

UR - http://www.scopus.com/inward/record.url?scp=85073148521&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073148521&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849401

DO - 10.1109/ISIT.2019.8849401

M3 - Conference contribution

AN - SCOPUS:85073148521

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2234

EP - 2238

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -