Redundancy rates for renewal and other processes

Imre Csiszar, Paul Shields

Research output: Paper

Abstract

This paper addresses a theoretical issue of universal noiseless source coding, viz., the best possible redundancy bound achievable for a given class of source models by block to variable-length lossless coding. For parametric model classes such as the memoryless or Markov sources, this bound grows as the log of the block-length n, [1, 2, 4]. Here we show that for the non-parametric class of renewal processes the growth rate is O(√n), while for the class of Markov renewal processes of order k the rate is O(nk+1/k+2).

Original languageEnglish
Publication statusPublished - dec. 1 1994
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: jún. 27 1994júl. 1 1994

Other

OtherProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period6/27/947/1/94

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Redundancy rates for renewal and other processes'. Together they form a unique fingerprint.

  • Cite this

    Csiszar, I., & Shields, P. (1994). Redundancy rates for renewal and other processes. Paper presented at Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, .