@inproceedings{f06bbbe8ac3947e7ab8875e862d8da2d,

title = "Minimax redundancy is a lower bound for most sources",

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.",

author = "Neri Merhav and Meir Feder",

year = "1994",

language = "אנגלית",

isbn = "0818656379",

series = "Proceedings of the Data Compression Conference",

publisher = "Publ by IEEE",

pages = "52--61",

editor = "Storer, {James A.} and Martin Cohn",

booktitle = "Proceedings of the Data Compression Conference",

note = "Proceedings of the Data Compression Conference ; Conference date: 29-03-1994 Through 31-03-1994",

}