{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:56Z","timestamp":1754161616339,"version":"3.41.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1023\/a:1008273408148","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"29-45","source":"Crossref","is-referenced-by-count":2,"title":["On Lower Bounds for the Redundancy of Optimal Codes"],"prefix":"10.1007","volume":"15","author":[{"given":"Roberto De","family":"Prisco","sequence":"first","affiliation":[]},{"given":"Alfredo De","family":"Santis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"168580_CR1","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/18.42226","volume":"IT-35","author":"R. M. Capocelli","year":"1989","unstructured":"R. M. Capocelli and A. De Santis, Tight upper bounds on the redundancy of Huffman codes, IEEE Trans. Inform. Theory, Vol. IT-35, No.5 (1989) pp. 1084\u20131091.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"168580_CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/18.61134","volume":"IT-37","author":"R. M. Capocelli","year":"1991","unstructured":"R. M. Capocelli and A. De Santis, A note on D-ary Huffman codes, IEEE Trans. Inform. Theory, Vol. IT-37, No.1 (1991) pp. 174\u2013179.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"168580_CR3","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1109\/18.87001","volume":"IT-37","author":"R. M. Capocelli","year":"1991","unstructured":"R. M. Capocelli and A. De Santis, New bounds on the redundancy of Huffman codes, IEEE Trans. Inform. Theory, Vol. IT-37, No.4 (1991) pp. 1095\u20131104.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"168580_CR4","doi-asserted-by":"crossref","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, Bounds on the redundancy of Huffman codes, IEEE Trans. Inform. Theory, Vol. IT-32, No.6 (1986) pp. 854\u2013857.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1-4","key":"168580_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0255(95)00220-0","volume":"88s.","author":"R. De Prisco","year":"1996","unstructured":"R. De Prisco and A. De Santis, On the redundancy achieved by Huffman codes, Information Sciences, Vol. 88, Nos.1-4 (1996) pp. 131\u2013148.","journal-title":"Information Sciences"},{"issue":"6","key":"168580_CR6","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"IT-24","author":"R. G. Gallager","year":"1978","unstructured":"R. G. Gallager, Variation on a theme by Huffman, IEEE Trans. Inform. Theory, Vol. IT-24, No.6 (1978) pp. 668\u2013674.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"168580_CR7","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0019-9958(77)80011-9","volume":"34","author":"Y. Horibe","year":"1977","unstructured":"Y. Horibe, An improved bound for weight-balanced trees, Inform. Contr., Vol. 34, No.2 (1977) pp. 148\u2013151.","journal-title":"Inform. Contr."},{"issue":"2","key":"168580_CR8","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, A method for the construction of minimum-redundancy codes, Proc. IRE, Vol. 40, No.2 (1952) pp. 1098\u20131101.","journal-title":"Proc. IRE"},{"issue":"2","key":"168580_CR9","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TIT.1980.1056158","volume":"IT-26","author":"O. Johnsen","year":"1980","unstructured":"O. Johnsen, On the redundancy of Huffman codes, IEEE Trans. Inform. Theory, Vol. IT-26, No.2 (1980) pp. 220\u2013222.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"168580_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1976.1055554","volume":"IT-22","author":"G. O. H. Katona","year":"1976","unstructured":"G. O. H. Katona and T. O. H. Nemetz, Huffman codes and self-information, IEEE Trans. Inform. Theory, Vol. IT-22, No.3 (1976) pp. 337\u2013340.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"168580_CR11","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/18.108260","volume":"IT-38","author":"D. Manstetten","year":"1992","unstructured":"D. Manstetten, Tight bounds on the redundancy of Huffman codes, IEEE Trans. Inform. Theory, Vol. IT-38, No.1 (1992) pp. 144\u2013151.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"168580_CR12","doi-asserted-by":"crossref","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, On the redundancy of optimal prefix-condition codes for finite and infinite sources, IEEE Trans. Inform. Theory, Vol. IT-33, No.1 (1987) pp. 156\u2013160.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"168580_CR13","doi-asserted-by":"crossref","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. V. Kumar, On the average codeword length of optimal binary codes for extended sources, IEEE Trans. Inform. Theory, Vol. IT-33, No.2 (1987) pp. 293\u2013296.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"168580_CR14","volume-title":"Introduction to Information Theory","author":"F. M. Reza","year":"1951","unstructured":"F. M. Reza, Introduction to Information Theory, McGraw-Hill, New York (1951)."},{"key":"168580_CR15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1147\/rd.172.0101","volume":"17","author":"J. Rissanen","year":"1973","unstructured":"J. Rissanen, Bounds for weight balanced tree, IBM J. Research and Development, Vol. 17 (1973) pp. 101\u2013105.","journal-title":"IBM J. Research and Development"},{"issue":"3","key":"168580_CR16","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/18.79933","volume":"IT-37","author":"R. Yeung","year":"1991","unstructured":"R. Yeung, The redundancy theorem and new bounds of the expected length of the Huffman code, IEEE Trans. Inform. Theory, Vol. IT-37, No.3 (1991) pp. 687\u2013691.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008273408148.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008273408148\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008273408148.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:32:48Z","timestamp":1753759968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008273408148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["168580"],"URL":"https:\/\/doi.org\/10.1023\/a:1008273408148","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}