Minimax redundancy is a lower bound for most sources

Neri Merhav, Meir Feder

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

Abstract

The capacity of the channel induced by a given class of sources is well known to be an attainable lower bound on the redundancy of universal codes w.r.t this class, both in the minimax sense and in the Bayesian (maximin) sense. Our main contribution is a relatively simple proof that the capacity is essentially a lower bound also in a stronger sense, that is, for 'most' sources in the class. This result extends Rissanen's lower bound for parametric families. Finally, we demonstrate the applicability of this result in several examples.

Original languageEnglish
Title of host publicationProceedings of the Data Compression Conference
EditorsJames A. Storer, Martin Cohn
PublisherPubl by IEEE
Pages52-61
Number of pages10
ISBN (Print)0818656379
StatePublished - 1994
EventProceedings of the Data Compression Conference - Snowbird, UT, USA
Duration: 29 Mar 199431 Mar 1994

Publication series

NameProceedings of the Data Compression Conference

Conference

ConferenceProceedings of the Data Compression Conference
CitySnowbird, UT, USA
Period29/03/9431/03/94

Fingerprint

Dive into the research topics of 'Minimax redundancy is a lower bound for most sources'. Together they form a unique fingerprint.

Cite this