3 search results - page 1 / 1 » Universal codes for finite sequences of integers drawn from ... |
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...
DAGSTUHL
2006
13 years 6 months ago
2006
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...