Results on the redundancy of universal compression for finite-length sequences
Results on the redundancy of universal compression for finite-length sequences
In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of the event that a sequence of length n, chosen using Jeffreys' prior from the family of parametric sources with d unknown parameters, …