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

Gunther, Ulrich

dc.contributor.author	Gunther, Ulrich	en
dc.date.accessioned	2009-04-16T23:15:42Z	en
dc.date.available	2009-04-16T23:15:42Z	en
dc.date.issued	2001-02	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-149 (2001)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3657	en
dc.description.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.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	T-Complexity and T-Information Theory -- an Executive Summary	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en