{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:25:49Z","timestamp":1745209549381,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/dcc.2003.1194031","type":"proceedings-article","created":{"date-parts":[[2003,11,4]],"date-time":"2003-11-04T23:56:54Z","timestamp":1067990214000},"page":"402-410","source":"Crossref","is-referenced-by-count":16,"title":["Performance of universal codes over infinite alphabets"],"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"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023307"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003851"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460040207"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023394"},{"key":"ref16","article-title":"Upper bounds on compression of unknown alphabets","author":"jevti?","year":"2002","journal-title":"Center for Wireless Communication semi-annual review"},{"key":"ref17","article-title":"On the MDL principle for universal compression of unknown alphabets","author":"shamir","year":"2002","journal-title":"Allerton"},{"article-title":"A course in combinatorics","year":"1996","author":"van lint","key":"ref18"},{"key":"ref19","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems of Information Transmission"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056936"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055960"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.485708"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9965.1991.tb00002.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023592"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.481776"}],"event":{"name":"Data Compression Conference","acronym":"DCC-03","location":"Snowbird, UT, USA"},"container-title":["Data Compression Conference, 2003. Proceedings. DCC 2003"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8491\/26854\/01194031.pdf?arnumber=1194031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T21:12:41Z","timestamp":1489439561000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1194031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/dcc.2003.1194031","relation":{},"subject":[]}}