{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:35:51Z","timestamp":1775054151497,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620751","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"2875-2879","source":"Crossref","is-referenced-by-count":5,"title":["Tight bounds for universal compression of large alphabets"],"prefix":"10.1109","author":[{"given":"Jayadev","family":"Acharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirakendu","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashkan","family":"Jafarpour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Orlitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananda Theertha","family":"Suresh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1987.1165125"},{"key":"17","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/18.825803","article-title":"Asymptotic minimax regret for data compression, gambling and prediction","volume":"46","author":"xie","year":"2000","journal-title":"IEEE-ITT"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.481776"},{"key":"16","first-page":"142","article-title":"On asymptotics of certain recurrences arising in universal coding","volume":"34","author":"szpankowski","year":"1998","journal-title":"Problems of Information Transmission"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9965.1991.tb00002.x"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056355"},{"key":"21","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":"20","doi-asserted-by":"publisher","DOI":"10.3115\/981863.981904"},{"key":"22","article-title":"A new upper bound on the redundancy of unknown alphabets","author":"shamir","year":"2004","journal-title":"CISS Princeton"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.3390\/e11040634"},{"key":"24","article-title":"Tight bounds on profile redundancy and distinguishability","author":"acharya","year":"2012","journal-title":"NIPS"},{"key":"25","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems of Information Transmission"},{"key":"26","article-title":"On modeling profiles instead of values","author":"orlitsky","year":"2004","journal-title":"Proceedings of the 20th conference on Uncertainty in artificial intelligence"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"28","article-title":"Competitive closeness testing","volume":"19","author":"acharya","year":"2011","journal-title":"COLT"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557571"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880044"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830761"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310917"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883609"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513572"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008150"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"8","first-page":"1","article-title":"Optimal coding in the case of unknown and changing message statistics","volume":"2","author":"fitingof","year":"1966","journal-title":"Probl Inform Transm"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","location":"Istanbul, Turkey","start":{"date-parts":[[2013,7,7]]},"end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620751.pdf?arnumber=6620751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:45:40Z","timestamp":1498074340000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620751\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620751","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}