Non-Asymptotic Fundamental Limits of Guessing Subject to Distortion

研究成果: Conference contribution

抄録

This paper investigates the problem of guessing subject to distortion, which was introduced by Arikan and Merhav. While the primary concern of the previous study was asymptotic analysis, our primary concern is non-asymptotic analysis. We prove non-asymptotic achievability and converse bounds of the moment of the number of guesses without side information (resp. with side information) by using a quantity based on the Rényi entropy (resp. the Arimoto-Rényi conditional entropy). Also, we introduce an error probability and show similar results. Further, from our bounds, we derive a single-letter characterization of the asymptotic exponent of guessing moment for a stationary memoryless source.

本文言語English
ホスト出版物のタイトル2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ページ652-656
ページ数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
国/地域France
CityParis
Period19/7/719/7/12

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 情報システム
  • モデリングとシミュレーション
  • 応用数学

フィンガープリント

「Non-Asymptotic Fundamental Limits of Guessing Subject to Distortion」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル