Fuzzy estimation of unknown source model for universal coding

An "estimation-like" algorithm of sequential universal coding of sources with unknown model is proposed. It is shown that for the set of all context tree models, with restricted depths of contexts, the maximal individual redundancy of such coding decreases not slower than O(/spl radic/((logn)/n)), n/spl rarr//spl infin/, where n is the message length.