{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:45:21Z","timestamp":1730274321606,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205702","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"625-629","source":"Crossref","is-referenced-by-count":4,"title":["A differential equation method to derive the formulas of the T-complexity and the LZ-complexity"],"prefix":"10.1109","author":[{"given":"Kenji","family":"Hamano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirosuke","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523285"},{"year":"0","key":"16"},{"key":"13","first-page":"443","article-title":"deterministic complexity and entropy","volume":"64","author":"titchener","year":"2005","journal-title":"Fundamenta Informaticae"},{"year":"0","author":"titchener","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708931"},{"year":"0","key":"12"},{"key":"3","first-page":"769","article-title":"data compression and serial communication with generalized t-codes","volume":"2","author":"gu?nther","year":"1996","journal-title":"Journal of Universal Computer Science"},{"key":"2","first-page":"91","article-title":"on the generation of aperiodic and periodic necklaces via t-augmentation","volume":"83","author":"gulliver","year":"2008","journal-title":"Fundamenta Informaticae"},{"key":"1","article-title":"elements of information theory","author":"cover","year":"2006","journal-title":"Wiley Series in Telecommunications and Signal Processing"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1049\/ip-e.1984.0028"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895570"},{"key":"5","first-page":"1011","article-title":"on properties of sequences with maximum t-complexity","author":"hamano","year":"2008","journal-title":"Proceedings SITA2008"},{"journal-title":"Robust source coding with generalized T-codes","year":"1998","author":"gu?nther","key":"4"},{"key":"9","article-title":"a statistical test suite for random and pseudorandom number generators for cryptographic applications","volume":"800 22","year":"2001","journal-title":"NIST Special Publication"},{"journal-title":"Data Compression with T-codes","year":"0","author":"mu?ller","key":"8"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205702.pdf?arnumber=5205702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T20:27:06Z","timestamp":1489782426000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205702\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205702","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}