{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T22:50:31Z","timestamp":1775515831213,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"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":[[2010,6]]},"DOI":"10.1109\/tit.2010.2046248","type":"journal-article","created":{"date-parts":[[2010,5,27]],"date-time":"2010-05-27T14:37:19Z","timestamp":1274971039000},"page":"2928-2937","source":"Crossref","is-referenced-by-count":14,"title":["Tunstall Code, Khodak Variations, and Random Walks"],"prefix":"10.1109","volume":"56","author":[{"given":"Michael","family":"Drmota","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuriy A.","family":"Reznik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"87","article-title":"universal variable-length to block codes for bernoulli sources","volume":"29","author":"trofimov","year":"1976","journal-title":"Methods of Discrete Analysis"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.119684"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057285"},{"key":"ref30","first-page":"81","article-title":"a comparative study of fixed-to-variable length and variable-to-fixed length source codes","author":"tjalkens","year":"2004","journal-title":"Proc 25th Symp Inf Theory in the Benelux"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.923727"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-4074-4_8"},{"key":"ref34","author":"tunstall","year":"1967","journal-title":"Synthesis of noiseless compression codes"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830765"},{"key":"ref11","author":"janson","year":"2009","journal-title":"Renewal Theory in Analysis of Tries and Strings"},{"key":"ref12","author":"jelinek","year":"1968","journal-title":"Probabilistic Information Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054899"},{"key":"ref14","article-title":"connection between redundancy and average delay of fixed-length coding","author":"khodak","year":"1969","journal-title":"All-Union Conf Problems of Theoretical Cybernetics"},{"key":"ref15","author":"krichevsky","year":"1993","journal-title":"Universal Data Compression and Retrieval"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-02-00951-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055749"},{"key":"ref19","article-title":"the entropy of a rooted tree with probabilities","author":"massey","year":"1983","journal-title":"Proc ISIT"},{"key":"ref28","author":"tjalkens","year":"1987","journal-title":"Efficient and Fast Data Compression Codes for Discrete Sources With Memory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0063-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878151"},{"key":"ref6","first-page":"291","article-title":"on the exit time of a random walk with the positive drift","author":"drmota","year":"2007","journal-title":"Proc Conf Anal Algorithms Proc Discr Math Theoret Comput Sci"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866671"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"ref8","volume":"13","author":"henrici","year":"1977","journal-title":"Applied and Computational Complex Analysis"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996709"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.259639"},{"key":"ref9","author":"jacquet","year":"1989","journal-title":"Contribution de l'analyse d'algorithmes a l'evaluation de protocoles de communication"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SEQUEN.1997.666911"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/83.918560"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.556121"},{"key":"ref21","first-page":"77","article-title":"on direct construction of variable-length-to-block codes","author":"reznik","year":"2006","journal-title":"Proc 27th Symp Inf Theory in the Benelux"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/5.892705"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1998.672213"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.887856"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<428::AID-RSA12>3.0.CO;2-6"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5466507\/05466547.pdf?arnumber=5466547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:01:08Z","timestamp":1633914068000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5466547\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":36,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2046248","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}