{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:31:45Z","timestamp":1780054305049,"version":"3.54.0"},"reference-count":7,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1981,3,1]],"date-time":"1981-03-01T00:00:00Z","timestamp":352252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1981,3,1]],"date-time":"1981-03-01T00:00:00Z","timestamp":352252800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1981,3,1]],"date-time":"1981-03-01T00:00:00Z","timestamp":352252800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1981,3]]},"DOI":"10.1109\/tit.1981.1056322","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"230-232","source":"Crossref","is-referenced-by-count":47,"title":["Generalization of Huffman coding to minimize the probability of buffer overflow (Corresp.)"],"prefix":"10.1109","volume":"27","author":[{"given":"P.","family":"Humblet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054147"},{"key":"ref3","author":"humblet","year":"1978","journal-title":"Source Coding for Communication Concentrators"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0127048"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054899"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1137\/0137015","article-title":"Binary trees optimum under various criteria","volume":"37","author":"hu","year":"1979","journal-title":"SIAM J Appl Math"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref1","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22719\/01056322.pdf?arnumber=1056322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:58:29Z","timestamp":1752775109000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056322\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,3]]},"references-count":7,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1981.1056322","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,3]]}}}