{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:46Z","timestamp":1740131686564,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["748\/10-1"],"award-info":[{"award-number":["748\/10-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tit.2019.2919829","type":"journal-article","created":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T20:02:52Z","timestamp":1559160172000},"page":"6399-6413","source":"Crossref","is-referenced-by-count":7,"title":["Universal Tree Source Coding Using Grammar-Based Compression"],"prefix":"10.1109","volume":"65","author":[{"given":"Moses","family":"Ganardi","sequence":"first","affiliation":[]},{"given":"Danny","family":"Hucke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4680-7198","authenticated-orcid":false,"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3204-3801","authenticated-orcid":false,"given":"Louisa","family":"Seelbach Benkner","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032034"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.12.007"},{"journal-title":"Inequalities","year":"1952","author":"hardy","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006830"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541052"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.841160"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2002.v2.n1.a2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.850665"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205704"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2295392"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.841161"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800191"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199710)11:3<223::AID-RSA2>3.0.CO;2-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00206-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-014-9544-x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"article-title":"On Shannon&#x2019;s inequality, optimal coding, and characterizations of Shannon&#x2019;s and Renyi&#x2019;s entropies","year":"1973","author":"acz\u00e9l","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2012-0016"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.06.006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21500-6_3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.144710"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541492"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.382011"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973761.7"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8836351\/08725547.pdf?arnumber=8725547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:07:57Z","timestamp":1657746477000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8725547\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":29,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2919829","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}