{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T07:10:23Z","timestamp":1742713823965,"version":"3.40.2"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1109\/tit.2002.1013141","type":"journal-article","created":{"date-parts":[[2002,11,7]],"date-time":"2002-11-07T19:41:04Z","timestamp":1036698064000},"page":"2022-2035","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources"],"prefix":"10.1109","volume":"48","author":[{"given":"I.","family":"Tabus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Rissanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3628-2"},{"article-title":"The entropy of a rooted tree with probabilities","volume-title":"IEEE Int. Symp. Information Theory","author":"Massey","key":"ref2"},{"volume-title":"Lectures on Information Theory (Lecture Notes)","year":"1997","author":"Rissanen","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.556121"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.771231"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/5.892705"},{"article-title":"Recursive procedure for extending the alphabet of Markov sources","year":"1998","author":"Tabus","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838153"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057285"},{"article-title":"Synthesis of noiseless compression codes","year":"1967","author":"Tunstall","key":"ref10"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/21818\/01013141.pdf?arnumber=1013141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T06:48:53Z","timestamp":1742712533000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1013141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,7]]}},"URL":"https:\/\/doi.org\/10.1109\/tit.2002.1013141","relation":{},"ISSN":["0018-9448"],"issn-type":[{"type":"print","value":"0018-9448"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}