A T-decomposition algorithm with O(n log n) time and space complexity

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 23-27

  Yang, Jia ^a   Speidel, Ulrich ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

CODING TREES; CONSTRUCTION ALGORITHMS; DECOMPOSITION ALGORITHMS; INFORMATION MEASURES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; PARAMETER ESTIMATION; PHASE SPACE METHODS; SIGNAL ENCODING;

INFORMATION THEORY;

EID: 33749451786     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523285     Document Type: Conference Paper

References (32)

1. http://highpi.4t.com/index.html, also known as HighPi.
2. W. Ebeling, R. Steuer, and M. R. Titchener: Partition-Based Entropies of Deterministic and Stochastic Maps, Stochostics and Dynamics, 1(1), p. 45., March 2001.
3. U. Guenther, P. Hertling, R. Nicolescu, and M. R. Titchener: Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders, Journal of Universal Computer Science, 3(11), November 1997, pp. 1207-1225. http://www.iicm.edu/jucs_3_11.
4. U. Guenther: Robust Source Coding with Generalized T-Codes. PhD Thesis, The University of Auckland, 1998. http://www.tcs.auckland.ac.nz/~ulrich/phd.pdf.
5. U. Guenther: T-Complexity and T-Information Theory - an Executive Summary. CDMTCS Report 149, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, February 2001. http://www.tes.auckland.ac.nz/CDMTCS/researchreports/149ulrich.pdf.
6. Project Gutenberg, http://www.gutenberg.net/.
7. G.R. Higgle: Analysis of the families of variable-length self-synchronizing codes called T-Codes, PhD thesis, The University of Auckland, 1991.
8. http://www.student.carleton.edu/~holschuj/.
9. http://burtleburtle.net/bob/hash/doobs.html.
10. http://burtleburtle.net/bob/hash/perfect.html.
11. A. Lempel and J. Ziv: On the complexity of finite sequences, IEEE Trans. Inform. Theory 22 (1976) 75-81.
12. R. Nicolescu: Uniqueness Theorems for T-Codes. Technical Report. Tamaki Report Series no.9, The University of Auckland, 1995.
13. R. Nicolescu and M. R. Titchener, Uniqueness Tneorems for T-Codes, Romanian Journal of Information Science and Technology, 1(3), March 1998, pp. 243-258.
14. http://www.partow.net/programming/hashfunctions.
15. Ulrich Speidel: Similarity Searches Using a Recursive String Parsing Algorithm, Supplemental Papers for the 2nd International Conference on Unconventional Models of Computation, UMC2K, Brussels, December 13-16, 2000, page 54.
16. M. R. Titchener: Unequivocal Dodes: String Complexity and Compressibility (Tamaki T-code project series), Technical report, Computer Science Dept., The University of Auckland, August, 1993.
17. M. R. Titchener and S. Wackrow: T-CODE Software Documentation (Tamaki T-code project series), Technical report, Computer Science Dept., The University of Auckland, August, 1995.
18. M.R. Titchener and JJ. Hunter: Synchronization Process for the Variable-Length T-codes. IEE Proceedings -Computers and Digital Techniques, 1985, 133(1), pp. 54-64.
19. M. R. Titchener: Generalized T-Codes: an Extended Construction Algorithm for Self-Synchronizing Variable-Length Codes, IEE Proceedings -Computers and Digital Techniques, 143(3), June 1996, pp. 122-128.
20. M. R. Titchener, Deterministic computation of string complexity, information and entropy, International Symposium on Information Theory, August 16-21, 1998, MIT, Boston.
21. M. R. Titchener: A Deterministic Theory of Complexity, Information and Entropy, IEEE Information Theory Workshop, February 1998, San Diego.
22. M. R. Titchener, A novel deterministic approach to evaluating the entropy of language texts, Third International Conference on Information Theoretic Approaches to Logic, Language and Computation, June 16-19, 1998, Hsi-tou, Taiwan.
23. M. R. Titchener: A measure of Information, IEEE Data Compression Conference, Snowbird, Utah, March 2000.
24. M. R. Titchener and U. Speidel and J. Yang: A Comparison of Practical Information Measures. CDMTCS Report 267, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, May 2005. http://www.tcs.auckland.ac.nz/CDMTCS/researchreports/267titchener.pdf.
25. S. Wackrow and M. R. Titchener (with some minor additions by U. Guenther): tcalc.c, written in C, available from http://tcode.tcs.auckland.ac. nz/~mark/, under the GNU GPL.
26. Mathworld: http://mathworld.wolfram.com/LogisticMap.html
27. Jia Yang and Ulrich Speidel: tlist.c, written in C, available on request from the authors, under the GNU GPL.
28. Jia Yang, Ulrich Speidel: An Improved T-decomposition Algorithm, 4th International Conference on Information, Communications & Signal Processing, Fourth IEEE Pacific-Rim Conference On Multimedia, Singapore, December 2003. Proceedings. Vol.3, pp. 1551-1555.
29. Jia Yang, Ulrich Speidel: T-information: A New Measure for Similarity Comparison, DMTCS 2003, December 2003 (Dijon, France, July 2003). Supplemental papers, pp. 29-39.
30. Jia Yang, Ulrich Speidel: A fast T-decomposition algorithm, accepted for publication in Journal of Universal Computer Science.
31. Jia Yang, Ulrich Speidel: A T-decomposition algorithm with O(n log n) time and space complexity. CDMTCS Report 259, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, February 2005. http://www.tes.auckland.ac.nz/CDMTCS/researchreports/259ulrich.pdf.
32. F. Zolghadr, B. Honary and M. Darnell: Statistical real-time channel evaluation (SRTCE) technique using variable-length T-codes, IEE Proceedings - Communications, speech and vision, 136(4), August 1989, pp. 259-266.