{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:34:23Z","timestamp":1729676063487,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523285","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"23-27","source":"Crossref","is-referenced-by-count":2,"title":["A T-decomposition algorithm with O(n log n) time and space complexity"],"prefix":"10.1109","author":[{"family":"Jia Yang","sequence":"first","affiliation":[]},{"given":"U.","family":"Speidel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"122","article-title":"Generalized T-codes: An extended construction algorithm for self-synchronizing variable-length codes","volume":"143","author":"titchener","year":"1996","journal-title":"IEE Proc Computers and Digital Techniques"},{"key":"17","article-title":"T-code software documentation (Tamaki T-code project series)","author":"titchener","year":"1995","journal-title":"Technical Report"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1049\/ip-e.1986.0005"},{"key":"15","first-page":"54","article-title":"Similarity searches using a recursive string parsing algorithm","author":"speidel","year":"2000","journal-title":"Supplemental Papers for the 2nd International Conference on Unconventional Models of Computation UMC2K"},{"key":"16","article-title":"Unequivocal dodes: String complexity and compressibility (Tamaki T-code project series)","author":"titchener","year":"1993","journal-title":"Technical Report"},{"key":"13","first-page":"243","article-title":"Uniqueness tneorems for T-codes","volume":"1","author":"nicolescu","year":"1998","journal-title":"Romanian Journal of Information Science and Technology"},{"year":"0","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055501"},{"key":"12","article-title":"Uniqueness theorems for T-codes","author":"nicolescu","year":"1995","journal-title":"Technical Report"},{"key":"21","article-title":"A deterministic theory of complexity, information and entropy","author":"titchener","year":"1998","journal-title":"IEEE Information Theory Workshop"},{"key":"20","article-title":"Deterministic computation of string complexity, information and entropy","author":"titchener","year":"1998","journal-title":"International Symposium on Information Theory"},{"key":"22","article-title":"A novel deterministic approach to evaluating the entropy of language texts","author":"titchener","year":"1998","journal-title":"Third International Conference on Information Theoretic Approaches to Logic Language and Computation"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838175"},{"key":"24","article-title":"A comparison of practical information measures","volume":"267","author":"titchener","year":"2005","journal-title":"CDMTCS Report"},{"year":"0","author":"wackrow","key":"25"},{"year":"0","key":"26"},{"year":"0","key":"27"},{"key":"28","first-page":"1551","article-title":"An improved T-decomposition algorithm","volume":"3","author":"yang","year":"2003","journal-title":"Proc 4th Int Conf on Information Communications and Signal Processing"},{"key":"29","first-page":"29","article-title":"T-information: A new measure for similarity comparison","author":"yang","year":"2003","journal-title":"DMTCS 2003"},{"key":"3","first-page":"1207","article-title":"Representing variable-length codes in fixed-length T-depletion format in encoders and decoders","volume":"3","author":"guenther","year":"1997","journal-title":"Journal of Universal Computer Science"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219493701000047"},{"year":"0","key":"10"},{"journal-title":"HighPi","year":"0","key":"1"},{"key":"30","article-title":"A fast T-decomposition algorithm","author":"yang","year":"0","journal-title":"Journal of Universal Computer Science"},{"journal-title":"Analysis of the Families of Variable-length Self-synchronizing Codes Called T-codes","year":"1991","author":"higgle","key":"7"},{"year":"0","key":"6"},{"key":"32","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1049\/ip-i-2.1989.0037","article-title":"statistical real-time channel evaluation (srtce) technique using variable length t-codes","volume":"136","author":"zolghadr","year":"1989","journal-title":"Communications Speech and Vision IEE Proceedings I"},{"key":"5","article-title":"T-complexity and T-information theory - An executive summary","volume":"149","author":"guenther","year":"2001","journal-title":"CDMTCS Report"},{"key":"31","article-title":"A T-decomposition algorithm with O(n log n) time and space complexity","volume":"259","author":"yang","year":"2005","journal-title":"CDMTCS Report"},{"journal-title":"Robust source coding with generalized T-codes","year":"1998","author":"guenther","key":"4"},{"year":"0","key":"9"},{"year":"0","key":"8"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523285.pdf?arnumber=1523285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T06:08:21Z","timestamp":1497679701000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523285\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523285","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}