A Comparison of Practical Information Measures

Show simple item record

dc.contributor.author Titchener, M.R en
dc.contributor.author Speidel, U en
dc.contributor.author Yang, J en
dc.date.accessioned 2009-04-16T23:10:02Z en
dc.date.available 2009-04-16T23:10:02Z en
dc.date.issued 2005-05 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-267 (2005) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri http://hdl.handle.net/2292/3774 en
dc.description.abstract This report compares a variety of computable information measures for finite strings. These include Shannon’s n-block entropy, the three best known versions of the Lempel-Ziv production complexity (LZ-76, LZ-77, and LZ-78), and the lesser known T-entropy. We apply these measures to strings of known entropy, each derived from the logistic map. Pesin’s identity allows us to deduce corresponding Shannon entropies (Kolmogorov-Sinai entropies) for the sample strings, without resorting to probabilistic methods. 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 A Comparison of Practical Information Measures 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

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace