52 search results - page 1 / 11 » Performance of universal codes over infinite alphabets |
DCC
2003
IEEE
14 years 3 months ago
2003
IEEE
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the margi...
IEICET
2006
13 years 4 months ago
2006
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
DM
2010
13 years 4 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
TIT
2002
13 years 4 months ago
2002
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...