Lower bounds on expected redundancy

Abstract

This paper focuses on lower bound results on expected redundancy for universal compression of i.i.d. data from parametric and nonparametric families. Two types of lower bounds are reviewed. One is Rissanen's almost pointwise lower bound and its extension to the nonparametric case. The other is minimax lower bounds, for which a new proof is given in the nonparametric case.