{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:10:27Z","timestamp":1729620627356,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itw.2004.1405282","type":"proceedings-article","created":{"date-parts":[[2005,4,6]],"date-time":"2005-04-06T11:20:51Z","timestamp":1112786451000},"page":"99-104","source":"Crossref","is-referenced-by-count":6,"title":["Limit results on pattern entropy"],"prefix":"10.1109","author":[{"given":"A.","family":"Orlitsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.P.","family":"Santhanam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705069"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90045-X"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2005.1531888"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"journal-title":"Proceedings of the 41st Annual Symposium on Foundations of Computer Science","year":"2003","key":"13"},{"key":"14","article-title":"Universal lossless compression with unknown alphabets-the average case","author":"shamir","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830761"},{"key":"12","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1126\/science.1088284","article-title":"Always Good Turing: Asymptotically optimal probability estimation","volume":"302","author":"orlitsky","year":"2003","journal-title":"Science"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-17.1.75"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460040207"},{"key":"20","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1017\/CBO9781107359949.008","author":"mcdiarmid","year":"1989","journal-title":"Surveys in Combinatorics 1989"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055960"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2003.1194031"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856948"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023394"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003851"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023592"},{"key":"8","article-title":"Multi-alphabet coding with separate alphabet description","author":"a?berg","year":"1997","journal-title":"Proceedings of Compression and Complexity of Sequences"}],"event":{"name":"2004 IEEE Information Theory Workshop","acronym":"ITW-04","location":"San Antonio, TX, USA"},"container-title":["Manufacturing Engineer"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9641\/30470\/01405282.pdf?arnumber=1405282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T14:02:20Z","timestamp":1497621740000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1405282\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/itw.2004.1405282","relation":{},"subject":[]}}