### 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 2^{nH}, 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 language | English |
---|---|

Title of host publication | Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 717-721 |

Number of pages | 5 |

ISBN (Electronic) | 9784885523182 |

DOIs | |

Publication status | Published - Mar 8 2019 |

Event | 15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, Singapore Duration: Oct 28 2018 → Oct 31 2018 |

### Publication series

Name | Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 |
---|

### Conference

Conference | 15th International Symposium on Information Theory and Its Applications, ISITA 2018 |
---|---|

Country | Singapore |

City | Singapore |

Period | 10/28/18 → 10/31/18 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science Applications
- Information Systems

### Cite this

*Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018*(pp. 717-721). [8664327] (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/ISITA.2018.8664327