3 papers
cs.IT2020
Bounds for Algorithmic Mutual Information and a Unifilar Order Estimator
Łukasz Dębowski
Inspired by Hilberg's hypothesis, which states that mutual information between blocks for natural language grows like a power law, we seek for links between power-law growth rate o…
cs.IT2020
On a Class of Markov Order Estimators Based on PPM and Other Universal Codes
Łukasz Dębowski
We investigate a class of estimators of the Markov order for stationary ergodic processes which form a slight modification of the constructions by Merhav, Gutman, and Ziv in 1989 a…
stat.ML2009
The Redundancy of a Computable Code on a Noncomputable Distribution
Łukasz Dębowski
We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin…