An analytic upper bound on T-complexity

Show simple item record Speidel, Ulrich en Gulliver, Thomas en
dc.coverage.spatial Cambridge, Massachusetts, USA en 2018-10-10T20:54:17Z en 2012 en
dc.identifier.isbn 978-1-4673-2580-6 en
dc.identifier.issn 2157-8095 en
dc.identifier.uri en
dc.description.abstract The Titchener T-complexity CT of a string has applications in, e.g., randomness testing, event detection and similarity comparison. Like the Lempel-Ziv production complexity, the upper bound of CT is demonstrably not a linear function of the string length. Knowledge of the bound for a given length is however required in order to convert CT into a measure with linear upper bound such as Titchener's T-information. For this reason, the upper bound of CT has been investigated before by several authors, with various asymptotic solutions proposed. We present a new analytic closed-form asymptotic upper bound for CT based on the Hurwitz-Lerch zeta function. en
dc.publisher IEEE en
dc.relation.ispartof 2012 IEEE International Symposium on Information Theory (ISIT) en
dc.relation.ispartofseries 2012 IEEE International Symposium on Information Theory Proceedings en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri en
dc.title An analytic upper bound on T-complexity en
dc.type Conference Item en
dc.identifier.doi 10.1109/ISIT.2012.6284014 en
pubs.begin-page 2706 en
dc.rights.holder Copyright: The author en
pubs.end-page 2710 en
pubs.finish-date 2012-07-06 en
pubs.start-date 2012-07-01 en
dc.rights.accessrights en
pubs.subtype Proceedings en
pubs.elements-id 365472 en Science en School of Computer Science en
pubs.record-created-at-source-date 2012-11-28 en

Files in this item

There are no files associated with this item.

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace