A differential equation method to derive the formulas of the T-complexity and the LZ-complexity

Authors:
Kenji Hamano;Hirosuke Yamamoto
Affiliations:
Graduate School of Frontier Sciences, The University of Tokyo, Kashiwa, Chiba, Japan;Graduate School of Frontier Sciences, The University of Tokyo, Kashiwa, Chiba, Japan
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 5
Cited 0

Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
A Measure of Information

DCC '00 Proceedings of the Conference on Data Compression
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Deterministic Complexity and Entropy

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On the Generation of Aperiodic and Periodic Necklaces via T-augmentation

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the T-complexity can be derived from a differential equation which represents how average codeword length increases by the T-augmentation. Furthermore, the proposed differential equation method can be applied to the LZ-complexity in the same way. This new approach is simple, and the obtained expressions coincide with the ones in previous studies.