{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:05:31Z","timestamp":1649005531993},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Swedish Foundation for Strategic Research through the Resource Allocation and Multi-Node Cooperation in Radio Access Networks Project"},{"name":"European Community's Seventh Framework Program (FP7\/2007-2013)","award":["INFSO-ICT-223844"],"award-info":[{"award-number":["INFSO-ICT-223844"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/tit.2014.2337311","type":"journal-article","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T18:33:01Z","timestamp":1404930781000},"page":"5486-5499","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Merging Algorithms for Lossless Codes With Generalized Criteria"],"prefix":"10.1109","volume":"60","author":[{"given":"Themistoklis","family":"Charalambous","sequence":"first","affiliation":[]},{"given":"Charalambos D.","family":"Charalambous","sequence":"additional","affiliation":[]},{"given":"Farzad","family":"Rezaei","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","first-page":"175","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems Inform Transmiss"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.720554"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.79912"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056167"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830765"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-642-10217-2_28","article-title":"Minimax trees in linear time with applications","author":"gawrychowski","year":"2009","journal-title":"Combinatorial Algorithms"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref16","article-title":"The transmission of information","author":"fano","year":"1949"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110670"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920205"},{"key":"ref28","article-title":"Optimal merging algorithms for lossless codes with generalized criteria","volume":"abs 1112 1715","author":"charalambous","year":"2011","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595328"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523602"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056322"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.481776"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90332-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860469"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915696"},{"key":"ref2","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054147"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033708"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1995.515509"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/9.763226"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/49.400652"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090214"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006454"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050947"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/26.634683"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6878505\/06851189.pdf?arnumber=6851189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:50:27Z","timestamp":1642006227000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6851189\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":32,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2337311","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}