### Abstract

The entropy rate of patterns of i.i.d. strings was determined. It was proved that for discrete distributations, and the entropy rate of patterns equals the distribution with continuous probability. It was shown that discrete distributions equals the modified distributions where the continuous probability was assigned to a new discrete element. It was also shown that the patterns satisfied an asymptotic equipartition property.

Original language | English (US) |
---|---|

Title of host publication | 2004 IEEE Information Theory Workshop - Proceedings, ITW |

Pages | 99-104 |

Number of pages | 6 |

State | Published - Dec 1 2004 |

Event | 2004 IEEE Information Theory Workshop - Proceedings, ITW - San Antonio, TX, United States Duration: Oct 24 2004 → Oct 29 2004 |

### Publication series

Name | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|

### Other

Other | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|---|

Country | United States |

City | San Antonio, TX |

Period | 10/24/04 → 10/29/04 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'Limit results on pattern entropy'. Together they form a unique fingerprint.

## Cite this

Orlitsky, A., Santhanam, N. P., Viswanathan, K., & Zhang, J. (2004). Limit results on pattern entropy. In

*2004 IEEE Information Theory Workshop - Proceedings, ITW*(pp. 99-104). (2004 IEEE Information Theory Workshop - Proceedings, ITW).