Refinements of MDL and MML coding

We discuss Rissanen's scheme of 'complete coding' in which a two-part data code is Further shortened by conditioning the second part not only on the e stimates, but also on the fact that these estimates were preferred to any o thers. We show that the scheme does not lead to improved estimates of param eters. The resulting message lengths may validly be employed to select amon g competing model classes in a global hypothesis space, but not to select a single member of the chosen class. A related coding scheme is introduced i n which the message commences by encoding an ancillary statistic, and then states parameter estimates using a code conditioned on this statistic. The use of Jeffreys priors in MDL codes is questioned and the resulting normali zation difficulties and violations of the likelihood principle are discusse d, We argue that the MDL objective of avoiding Bayesian Driers mag; be bett er pursued by other means.