T-Complexity and T-Information Theory -- an Executive Summary

T-Complexity and T-Information Theory -- an Executive Summary: "T-Complexity and T-Information Theory -- an Executive Summary
Gunther, Ulrich
Identifier: http://hdl.handle.net/2292/3657
Issue Date: 2001-02
Reference: CDMTCS Research Reports CDMTCS-149 (2001)
Rights: The author(s)
Rights (URI): https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
Abstract:
This paper describes the derivation of the T-Complexity and T-Information
Theory from the decomposition of finite strings, based on the
duality of strings and variable-length T-Codes. It further outlines its similarity
to the string parsing algorithm by Lempel and Ziv. It is intended
as a summary of work published mainly by Titchener and Nicolescu.
Show full item record

"

'via Blog this'