Jeffreys' prior yields the asymptotic minimax redundancy
Bertrand S. Clarke, Andrew R. Barron · 2002
We determine the asymptotic minimax redundancy of universal data compression in a parametric setting and show that it corresponds to the use of Jeffreys prior. Statistically, this formulation of the coding problem can be interpreted in a prior selection context and in an estimation context.