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

@article{Yang2005ATA,
  title={A T-decomposition algorithm with O(n log n) time and space complexity},
  author={Jia Yang and Ulrich Speidel},
  journal={Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.},
  year={2005},
  pages={23-27}
}
T-decomposition maps a finite string into a series of parameters for a recursive string construction algorithm. Initially developed for the communication of coding trees (M. R. Titchener, June 1996), (U. Guenther, Feb. 2001), T-decomposition has since been studied within the context of information measures. This involves the parsing of potentially very large strings, which in turn requires algorithms with good time complexity. This paper presents a T-decomposition algorithm with O(n log n) time… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS
18 Citations
17 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Robust Source Coding with Generalized T- Codes

  • U. Guenther
  • PhD Thesis, The University of Auckland,
  • 1998
Highly Influential
9 Excerpts

Uniqueness Theorems for T-Codes

  • R. Nicolescu
  • Technical Report. Tamaki Report Series
  • 1995
Highly Influential
10 Excerpts

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

  • Jia Yang, Ulrich Speidel
  • CDMTCS Report 259, Centre for Discrete…
  • 2005

An Improved T-decomposition Algorithm

  • Jia Yang, Ulrich Speidel
  • 4th International Conference on Information…
  • 2003
1 Excerpt

T-information: A New Measure for Similarity Comparison

  • Jia Yang, Ulrich Speidel
  • DMTCS
  • 2003
1 Excerpt

T-Complexity and T-Information Theory – an Executive Summary. CDMTCS Report 149, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland

  • U. Guenther
  • 2001
1 Excerpt

Titchener: Partition-Based Entropies of Deterministic and Stochastic Maps

  • W. Ebeling, R. Steuer, R M.
  • Stochastics and Dynamics,
  • 2001
1 Excerpt

Similarity Searches Using a Recursive String Parsing Algorithm, Supplemental Papers for the 2nd International Conference on Unconventional Models of Computation, UMC2K, Brussels, December

  • Ulrich Speidel
  • 2000
1 Excerpt

Titchener: A measure of Information, IEEE Data Compression

  • M R.
  • 2000
1 Excerpt

Deterministic computation of string complexity, information and entropy

  • M. R. Titchener
  • International Symposium on Information Theory…
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…