Bounds on universal coding: the next generation

Abstract

An important class of universal encoders is the one where the encoder is fed by two inputs: a) The incoming string of data to be compressed. b) An N-bit description of the source statistics (i.e. a "training sequence"). We consider fixed-to-variable universal encoders that noiselessly compress blocks of length l.