Fuzzy estimation of unknown source model for universal coding

27 November 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 17-18
https://doi.org/10.1109/itw.1998.706380

Abstract

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.

Keywords

ARITHMETIC
CONTEXT MODELING
COSTS
UPPER BOUND
DECODING

This publication has 2 references indexed in Scilit:

Switching between two universal source coding algorithms
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
A universal finite memory source
IEEE Transactions on Information Theory, 1995