R.Krichevsky, Universal Compression and Retrieval, Kluwer Academic Publishers (1994). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Coding Combinatorial Sources with Costs - Suzuki, Ryabko (2000) (Correct)
....We address the problem of noiseless coding of combinatorial sources. By the combinatorial source, we simply mean a subset of the infinite sequences. Such a nonprobabilistic approach was first considered by A. Kolmogorov [5] and later was used in B. Ryabko [7] L. Staiger [9] R. Krichevskey [6] etc. In [7] it was shown that an essential bound of the optimal code is equal to the Hausdorf dimension of the combinatorial source. In this paper, we consider the case in which the source and channel alphabets have general costs. This generalization is natural for information theory and has ....
R.Krichevsky, Universal Compression and Retrieval, Kluwer Academic Publishers (1994).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC