A fast T-decomposition algorithm

Journal of Universal Computer Science

Volumn 11, Issue 6, 2005, Pages 1083-1101

  Yang, Jia ^a   Speidel, Ulrich ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Computable complexity measures; Entropy; Parsing; T decomposition

Indexed keywords

EID: 23844551755     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Review

References (23)

1. [Ebeling et al. 2001] W. Ebeling, R. Steuer, and M. R. Titchener: Partition-Based Entropies of Deterministic and Stochastic Maps, Stochastics and Dynamics, 1(1), p. 45., March 2001.
2. [Guenther et al. 1997] 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.
3. [Guenther 1998] U. Guenther: Robust Source Coding with Generalized T-Codes. PhD Thesis, The University of Auckland, 1998. http://www.tes.auckland. ac.nz/~ulrich/phd.pdf.
4. [Gutenberg 2004] Project Gutenberg, http://www.gutenberg.net/.
5. [Jenkins 2004] Bob Jenkins' Web site: http://burtleburtle.net/bob/hash/ doobs.html.
6. [Nicolescu 1995] R. Nicolescu: Uniqueness Theorems for T-Codes. Technical Report. Tamaki R.eport Series no.9, The University of Auckland, 1995.
7. [Nicolescu and Titchener 1998] R. Nicolescu and M. R. Titchener, Uniqueness Theorems for T-Codes, Romanian Journal of Information Science and Technology, 1(3), March 1998, pp. 243-258.
8. [Partow 2004] Arash Partow's Web site: http://www.partow.net/programming/ hashfunctions.
9. [Speidel 2000] 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.
10. [Titchener 1993] M. R. Titchener: Unequivocal Dodes: String Complexity and Compressibility (Tamaki T-code project series), Technique report, Computer Science Dept., The University of Auckland, August, 1993.
11. [Titchener and Wackrow 1995] M. R. Titchener and S. Wackrow: T-CODE Software Documentation (Tamaki T-code project series), Technique report, Computer Science Dept., The University of Auckland, August, 1995.
12. [Titchener 1996] 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.
13. [Titchener 1998a] M. R. Titchener, Deterministic computation of string complexity, information and entropy, International Symposium on Information Theory, August 16-21, 1998, MIT, Boston.
14. [Titchener 1998b] M. R. Titchener: A Deterministic Theory of Complexity, Information and Entropy, IEEE Information Theory Workshop, February 1998, San Diego.
15. [Titchener 1998c] 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.
16. [Titchener 2000] M. R. Titchener: A measure of Information, IEEE Data Compression Conference, Snowbird, Utah, March 2000.
17. [Titchener et. al. 2005] M. R. Titchener and A. Gulliver and R. Nicolescu and U. Speidel and L. Staiger: Deterministic Complexity and Entropy, FUINE 64(1-4)1-482(2005), IOS Press.
18. [Wackrow and Titchener 1998] 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.
19. [Weisstein 2004] Eric Weisstein's Web site: http://mathworld.wolfram.com/ LogisticMap.html, also known as mathworld.
20. [Yang and Speidel 2003a] Jia Yang and Ulrich Speidel: tlist.c, written in C, available on request from the authors, under the GNU GPL.
21. [Yang and Speidel 2003b] 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.
22. [Yang and Speidel 2003c] 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.
23. [Yang and Speidel 2005] Jia Yang, Ulrich Speidel: A T-decomposition algorithm with O(n log n) time and space compiexity, to appear in Proceedings of the 2005 IEEE International Symposium on Information Theory (ISIT2005), Adelaide, Australia, September 2005.