Universal redundancy rates for B-processes do not exist

Paul Shields, Benjamin Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Shows 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, [Shields, 1993]. The class of B-processes, that is, stationary codings of i.i.d. processes, includes the aperiodic Markov chains and functions thereof, aperiodic renewal and regenerative processes, and independent processes, as well as many other processes of interest. In particular, the 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
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages181
Number of pages1
ISBN (Print)0780320158, 9780780320154
DOIs
StatePublished - 1994
Externally publishedYes
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'Universal redundancy rates for B-processes do not exist'. Together they form a unique fingerprint.

Cite this