Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension
From MaRDI portal
Publication:3547688
DOI10.1109/TIT.2004.836663zbMath1298.94059MaRDI QIDQ3547688
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Hausdorff dimensionKolmogorov complexityuniversal codingstochastic complexityBayes methodsA priori probabilityminimum description length (MDL) code
Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80) Source coding (94A29)
Related Items (1)
This page was built for publication: Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension