DocumentCode
397335
Title
Redundancy of universal coding, Kolmogorov complexity, and Hausdorff dimension
Author
Takahashi, Hiroki
Author_Institution
Dept. of Math. & Comput. Sci., Tokyo Inst. of Technol., Japan
fYear
2003
fDate
29 June-4 July 2003
Firstpage
77
Abstract
The code-lengths shown in this paper give a nontrivial upper and lower bound of Kolmogorov complexity when the source is not a computable measure.
Keywords
codes; Hausdorff dimension; Kolmogorov complexity; code-length; universal coding redundancy; Extraterrestrial measurements; Frequency; Information theory; Maximum likelihood estimation; Multidimensional systems; Parametric statistics; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228091
Filename
1228091
Link To Document