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

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.

[1]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[2]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[3]  Ludwig Staiger,et al.  Deterministic Complexity and Entropy , 2005, Fundam. Informaticae.

[4]  Ulrich Günther.  Robust source coding with generalised T-Codes , 1998 .

[5]  Mark R. Titchener.  A measure of information , 2000, Proceedings DCC 2000. Data Compression Conference.

[6]  Ulrich Speidel.  Data Compression and Serial Cummunication with Generalized T-Codes , 1996, J. Univers. Comput. Sci..

[7]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[8]  Ulrich Günther,et al.  Data Compression and Serial Cummunication with Generalized T-Codes. , 1996 .

[9]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[10]  T. Aaron Gulliver,et al.  On the Generation of Aperiodic and Periodic Necklaces via T-augmentation , 2008, Fundam. Informaticae.

[11]  M. Titchener.  Deterministic computation of complexity, information and entropy , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[12]  K. Hamano,et al.  A randomness test based on T-codes , 2008, 2008 International Symposium on Information Theory and Its Applications.

[13]  An improved Ziv‐lempel coding scheme for universal source coding , 1986 .

[14]  Jia Yang,et al.  A T-decomposition algorithm with O(n log n) time and space complexity , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..