{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:06:01Z","timestamp":1761293161369},"reference-count":27,"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":"Adams Fellowship"},{"name":"ITA Fellowship"},{"name":"Israel Academy of Science, Israel Science Foundation","award":["870\/11"],"award-info":[{"award-number":["870\/11"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/tit.2014.2331954","type":"journal-article","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T18:32:16Z","timestamp":1404153136000},"page":"5470-5485","source":"Crossref","is-referenced-by-count":5,"title":["Delay and Redundancy in Lossless Source Coding"],"prefix":"10.1109","volume":"60","author":[{"given":"Ofer","family":"Shayevitz","sequence":"first","affiliation":[]},{"given":"Eado","family":"Meron","sequence":"additional","affiliation":[]},{"given":"Meir","family":"Feder","sequence":"additional","affiliation":[]},{"given":"Ram","family":"Zamir","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"abramson","year":"1963","journal-title":"Information Theory and Coding"},{"key":"ref11","author":"jelinek","year":"1968","journal-title":"Probabilistic Information Theory"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1147\/rd.232.0149","article-title":"Arithmetic coding","volume":"23","author":"langdon","year":"1979","journal-title":"IBM J Res Develop"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"ref14","article-title":"Lecture notes","author":"gallager","year":"0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.272459"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262136"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2007.19"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2008.84"},{"key":"ref19","article-title":"Arithmetic coding for finite-state noiseless channels","author":"savari","year":"1992"},{"key":"ref4","article-title":"Delay-redundancy relation of VB-encoding (in Russian)","author":"khodak","year":"1969","journal-title":"Proc All-Union Conf Theoretical Cybern Novobirsk"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.135641"},{"key":"ref3","article-title":"Synthesis of noiseless compression codes","author":"tunstall","year":"1967"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261984"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.887856"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929959"},{"key":"ref7","first-page":"21","article-title":"Bounds of redundancy estimates for word-based encoding of sequences produced by a bernoulli source (Russian)","volume":"8","author":"khodak","year":"1972","journal-title":"Problemy Peredachi Inform"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057285"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/290159.290162"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054147"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034266"},{"key":"ref23","first-page":"547","article-title":"On measures of entropy and information","volume":"1","author":"r\u00e9nyi","year":"1960","journal-title":"Proc 4th Berkeley Symp Math Statist Probab"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/5.892705"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6878505\/06846353.pdf?arnumber=6846353","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\/6846353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":27,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2331954","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}