{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:11:46Z","timestamp":1725631906055},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543039"},{"type":"electronic","value":"9783540475460"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54303-1_142","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T16:16:38Z","timestamp":1320855398000},"page":"309-317","source":"Crossref","is-referenced-by-count":3,"title":["Minimum codeword length and redundancy of Huffman codes"],"prefix":"10.1007","author":[{"given":"Renato M.","family":"Capocelli","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,8,1]]},"reference":[{"issue":"6","key":"31_CR1","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"IT-24","author":"R. G. Gallager","year":"1978","unstructured":"R. G. Gallager, \u201cVariation on a theme by Huffman,\u201d IEEE Trans. on Inform. Theory, vol. IT-24, no. 6, pp. 668\u2013674, Nov. 1978.","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"6","key":"31_CR2","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1109\/TIT.1986.1057239","volume":"IT-32","author":"R. M. Capocelli","year":"1986","unstructured":"R. M. Capocelli, R. Giancarlo and I. J. Taneja, \u201cBounds on the redundancy of Huffman codes,\u201d IEEE Trans. on Inform. Theory, vol. IT-32, no. 6, pp. 854\u2013857, Nov. 1986.","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"5","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/18.42226","volume":"35","author":"R. M. Capocelli","year":"1989","unstructured":"R. M. Capocelli and A. De Santis, \u201cTight upper bounds on the redundancy of Huffman codes,\u201d IEEE Trans. Inform. Theory, vol. 35, n. 5, pp. 1084\u20131091, Sept. 1989.","journal-title":"IEEE Trans. Inform. Theory"},{"unstructured":"R. M. Capocelli and A. De Santis, \u201cTight bounds on the redundancy of Huffman codes,\u201d IBM Research Report RC-14154.","key":"31_CR4"},{"doi-asserted-by":"crossref","unstructured":"R. M. Capocelli and A. De Santis, \u201cA note on D-ary Huffman codes,\u201d to appear on IEEE Trans. Inform. Theory, Jan. 1991.","key":"31_CR5","DOI":"10.1109\/18.61134"},{"unstructured":"R. M. Capocelli and A. De Santis, \u201cNew bounds on the redundancy of Huffman codes,\u201d to appear on IEEE Trans. Inform. Theory.","key":"31_CR6"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. A. Huffman","year":"1952","unstructured":"D. A. Huffman, \u201cA method for the construction of minimum redundancy codes,\u201d Proc. IRE, vol. 40, pp. 1098\u20131101, 1952.","journal-title":"Proc. IRE"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1109\/TIT.1980.1056158","volume":"IT-26","author":"O. Johnsen","year":"1980","unstructured":"O. Johnsen, \u201cOn the redundancy of Huffman codes,\u201d, IEEE Trans. on Inform. Theory, vol. IT-26, no. 2, pp. 220\u2013222, Mar. 1980.","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/TIT.1987.1057280","volume":"IT-33","author":"B. L. Montgomery","year":"1987","unstructured":"B. L. Montgomery and B. V. K. Vijaya Kumar, \u201cOn the average codeword length of optimal binary codes for extended sources,\u201d IEEE Trans. on Inform. Theory, vol. IT-33, no. 2, pp. 293\u2013296, Mar. 1987.","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TIT.1987.1057266","volume":"IT-33","author":"B. L. Montgomery","year":"1987","unstructured":"B. L. Montgomery and J. Abrahams, \u201cOn the redundancy of optimal binary prefixcondition codes for finite and infinite sources,\u201d IEEE Trans. Inform. Theory, vol. IT-33, no. 1, pp. 156\u2013160, Jan. 1987.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","EUROCODE '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54303-1_142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T05:43:04Z","timestamp":1560922984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54303-1_142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543039","9783540475460"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-54303-1_142","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}