{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:32:32Z","timestamp":1753889552965},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1977,6,1]],"date-time":"1977-06-01T00:00:00Z","timestamp":233971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":13196,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1977,6]]},"DOI":"10.1016\/s0019-9958(77)80011-9","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"148-151","source":"Crossref","is-referenced-by-count":29,"title":["An improved bound for weight-balanced tree"],"prefix":"10.1016","volume":"34","author":[{"given":"Yasuichi","family":"Horibe","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(77)80011-9_bib1","series-title":"Information Theory","author":"Ash","year":"1965"},{"key":"10.1016\/S0019-9958(77)80011-9_bib2","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","article-title":"Variable-length binary encodings","volume":"38","author":"Gilbert","year":"1959","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0019-9958(77)80011-9_bib3","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","article-title":"Optimal computer search trees and variable-length alphabetical codes","volume":"21","author":"Hu","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0019-9958(77)80011-9_bib4","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0019-9958(77)80011-9_bib5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1147\/rd.172.0101","article-title":"Bounds for weight balanced trees","volume":"17","author":"Rissanen","year":"1973","journal-title":"IBM J. Res. Develop."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995877800119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995877800119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:20:58Z","timestamp":1548944458000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995877800119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["S0019995877800119"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(77)80011-9","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}