Universal Redundancy Rates for the Class of B-Processes Do Not Exist

Paul Shields, Benjamin Weiss

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

We show that for any sequence ρ(n) = o(n) and any sequence of prefix codes, there is a B-process of entropy arbitrarily close to the maximum possible entropy for which the expected redundancy is at least as large as ρ(n) for infinitely many n. This extends earlier work of the first author, whose examples had 0 entropy, [5]. The class of B-prucesses, that is, stationary codings of independent and identically distributed (i.i.d.) processes, includes the aperiodic Markov chains and functions thereof, aperiodic renewal and regenerative processes, and m-dependent processes, as well as many other processes of interest. In particular, our results show that the search for a universal redundancy rate for the class of all B-processes is doomed to failure, and redundancy rates for any given subclass must be obtained by direct analysis of that subclass.

Original languageEnglish
Pages (from-to)508-512
Number of pages5
JournalIEEE Transactions on Information Theory
Volume41
Issue number2
DOIs
StatePublished - Mar 1995

Keywords

  • B-processes
  • Redundancy
  • universal redundancy-rates

Fingerprint

Dive into the research topics of 'Universal Redundancy Rates for the Class of B-Processes Do Not Exist'. Together they form a unique fingerprint.

Cite this