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

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ページ2234-2238
ページ数5
ISBN(電子版)9781538692912
DOI
出版ステータスPublished - 2019 7
イベント2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
継続期間: 2019 7 72019 7 12

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
2019-July
ISSN(印刷版)2157-8095

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
CountryFrance
CityParis
Period19/7/719/7/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

フィンガープリント 「Source resolvability problem with respect to a certain subclass of f-divergence」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル