On the ratio between the maximal T-complexity and the T-complexity of random strings

ResearchSpace/Manakin Repository

Show simple item record

dc.contributor.author Gulliver, Thomas en
dc.contributor.author Speidel, Ulrich en
dc.coverage.spatial Honolulu, Hawaii, USA en
dc.date.accessioned 2018-10-08T00:23:55Z en
dc.date.issued 2012 en
dc.identifier.isbn 978-1-4673-2521-9 en
dc.identifier.uri http://hdl.handle.net/2292/39273 en
dc.description.abstract This paper derives an asymptotic closed form expression for the ratio between minimal codeword length in systematic T-augmentation and expected codeword length in random T-augmentation, confirming existing empirical results by Hamano. We also show that this ratio corresponds, in the limit, to the ratio between the maximal T-complexity and the T-complexity of random strings of a given string length. en
dc.relation.ispartof 2012 International Symposium on Information Theory and its Applications (ISITA) 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 https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title On the ratio between the maximal T-complexity and the T-complexity of random strings en
dc.type Conference Item en
pubs.begin-page 498 en
dc.rights.holder Copyright: The author en
pubs.author-url http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6400985&refinements=4229840942&filter=AND(p_IS_Number:6400891) en
pubs.end-page 500 en
pubs.finish-date 2012-10-31 en
pubs.start-date 2012-10-28 en
dc.rights.accessrights http://purl.org/eprint/accessRights/RestrictedAccess en
pubs.subtype Conference Paper en
pubs.elements-id 365485 en
pubs.org-id Science en
pubs.org-id School of Computer Science en
pubs.record-created-at-source-date 2012-11-28 en


Full text options

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Advanced Search

Browse