{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:17Z","timestamp":1725662837372},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540088608"},{"type":"electronic","value":"9783540358077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:34:06Z","timestamp":1330169646000},"page":"15-25","source":"Crossref","is-referenced-by-count":2,"title":["Codes : Unequal probabilities, unequal letter costs"],"prefix":"10.1007","author":[{"given":"Doris","family":"Altenkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"2_CR1","volume-title":"Information Theory","author":"Ash","year":"1965","unstructured":"Ash: Information Theory, Interscience Publishers, N.Y., 1965"},{"key":"2_CR2","unstructured":"Bayer, P.: Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees, to appear in Acta Informatica."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Fredman, M.L.: Two Applications of a Probabilistic Search Technique, ACM Conf. on Theory of Computing, 1975.","DOI":"10.1145\/800116.803774"},{"key":"2_CR4","unstructured":"Gilbert, E.N. & Moore, E.F.: Variable Length Encordings, Bell System Technical Journal, 1971."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Hu, T.C. & Tucker, A.C.: Optimal Computer Search Trees and Variable Length Alphabetic Codes, SIAM J. Appl. Math. 21, 1971.","DOI":"10.1137\/0121057"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. A. Huffmann","year":"1952","unstructured":"Huffmann, D.A.: A Method for the Construction of Minimum-Redundancy Codes, Proc. IRE 40, 1098\u20131101, 1952","journal-title":"Proc. IRE"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Itai, A.: Optimal Alphabetic Trees, SIAM J. Computing, 9\u201318, March 1976.","DOI":"10.1137\/0205002"},{"key":"2_CR8","unstructured":"Karp, R.M.: Minimum Redundancy Coding for the Discrete Noiseless Channel."},{"key":"2_CR9","volume-title":"Effiziente Algorithmen","author":"K. Mehlhorn","year":"1977","unstructured":"Mehlhorn, K.: Effiziente Algorithmen, Teubner Studienb\u00fccher Informatik, Stuttgart, 1977."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Best Possible Bounds on the Weighted Path Length of Optimum Binary Search Trees, SIAM J. of Comp. Vol. 6, No. 2, 1977","DOI":"10.1137\/0206017"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/321879.321883","volume":"22","author":"Y. Perl","year":"1975","unstructured":"Perl, Y. & Garey, M.R. & Even, S.: Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letter, JACM, Vol. 22 No. 2, 202\u2013214, April 1975.","journal-title":"JACM"},{"key":"2_CR12","unstructured":"v. Leuwen, J.: On the construction of Huffmann trees, 3rd ICALP (1976), 382\u2013410."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:00:02Z","timestamp":1605625202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}