{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:13:10Z","timestamp":1758845590814},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1981,11]]},"DOI":"10.1007\/bf00289311","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T03:28:19Z","timestamp":1096946899000},"page":"363-370","source":"Crossref","is-referenced-by-count":7,"title":["Best Huffman trees"],"prefix":"10.1007","volume":"16","author":[{"given":"George","family":"Markowsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Algorithmic combinatorics","author":"S. Even","year":"1973","unstructured":"Even, S.: Algorithmic combinatorics. New York: Macmillan 1973"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40, 1098?1101 (1952)","journal-title":"Proc. IRE"},{"key":"CR3","volume-title":"Minimal variance Huffman codes. IBM Technical Report RC8333, T.J.","author":"L.T. Kou","year":"1980","unstructured":"Kou, L.T.: Minimal variance Huffman codes. IBM Technical Report RC8333, T.J. Yorktown Heights, NY: Watson esearch Center 1980"},{"key":"CR4","volume-title":"The theory of information and coding","author":"R.J. McEliece","year":"1977","unstructured":"McEliece, R.J.: The theory of information and coding. Reading, Mass.: Addison-Wesley 1977"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0019-9958(64)90241-4","volume":"7","author":"E.S. Schwartz","year":"1964","unstructured":"Schwartz, E.S.: An optimal encoding with minimum longest code and total number of digits. Information and control, 7, 37?44 (1964)","journal-title":"Information and control"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289311.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289311\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:47Z","timestamp":1554758087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["BF00289311"],"URL":"https:\/\/doi.org\/10.1007\/bf00289311","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}