Asymptotic Behavior of Typical Sets and the Smallest High Probability Set

Munenori Eto, Masanori Kawakita, Junrichi Takeuchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Cardinality of typical sets and the smallest high probability set for discrete memoryless sources and stationary Markov sources are considered. Usually, its width is fixed in the definition of both sets, but sometimes it is assumed that the width converges to zero as the length of sequence n goes to infinity. In such setting, some condition for the width is necessary to make the cardinality near 2nH, where H denotes the entropy rate of the information source. In this article, we give sufficient conditions for the above propositions. We also show sufficient conditions for that they don't hold for DMS and Markov sources under a certain restriction.

Original languageEnglish
Title of host publicationProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages717-721
Number of pages5
ISBN (Electronic)9784885523182
DOIs
Publication statusPublished - Mar 8 2019
Event15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, Singapore
Duration: Oct 28 2018Oct 31 2018

Publication series

NameProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

Conference

Conference15th International Symposium on Information Theory and Its Applications, ISITA 2018
Country/TerritorySingapore
CitySingapore
Period10/28/1810/31/18

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

Fingerprint

Dive into the research topics of 'Asymptotic Behavior of Typical Sets and the Smallest High Probability Set'. Together they form a unique fingerprint.

Cite this