Munich Personal RePEc Archive (Ludwig Maximilian University of Munich) · 1994 · 11 citations · 6 references
In this paper we apply an ecient method for estimating probabilities over non-binary and not completely known source alphabets to the Context Tree Weighting algorithm. We discuss the redundancy of the resulting data compresion code and its complexity. 1
6
Prediction and Entropy of Printed English
Claude E. Shannon · Bell System Technical Journal · 1951 · 2.6K citations
J. Rissanen, Glen G. Langdon · IBM Journal of Research and Development · 1979 · 729 citations