{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:04Z","timestamp":1773377764784,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849635","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"557-561","source":"Crossref","is-referenced-by-count":0,"title":["Tail redundancy and its characterizations of universal compression"],"prefix":"10.1109","author":[{"given":"Maryam","family":"Hosseini","sequence":"first","affiliation":[{"name":"University of Hawaii at Manoa, Honolulu, HI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narayana","family":"Santhanam","sequence":"additional","affiliation":[{"name":"University of Hawaii at Manoa, Honolulu, HI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Coding on countably infinite alphabets","author":"boucheron","year":"2008","journal-title":"arXiv doc id 0801 2456"},{"key":"ref11","article-title":"On the universality of grammar-based codes for sources with countably infinite alphabets","author":"he","year":"2003","journal-title":"Proceedings of IEEE Symposium on Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447108"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875159"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804115"},{"key":"ref5","first-page":"114","article-title":"Multialphabet universal coding of memoryless sources","volume":"31","author":"shtarkov","year":"1995","journal-title":"Problems of Information Transmission"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.605594"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1030741081"},{"key":"ref2","first-page":"269","article-title":"Efficient universal noiseless source codes","volume":"279","author":"pursley","year":"1981","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.382017"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849635.pdf?arnumber=8849635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:05Z","timestamp":1773347705000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849635\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849635","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}