{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:57Z","timestamp":1759335837423},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_29","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"306-318","source":"Crossref","is-referenced-by-count":8,"title":["Generalized Shannon Code Minimizes the Maximal Redundancy"],"prefix":"10.1007","author":[{"given":"Michael","family":"Drmota","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"J. Abrahams, Code and Parse Trees for Lossless Source Encoding, Proc. of Compression and Complexity of SEQUENCE\u201997, Positano, IEEE Press, 145\u2013171, 1998.","DOI":"10.1109\/SEQUEN.1997.666911"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1109\/18.720554","volume":"44","author":"A. Barron","year":"1998","unstructured":"A. Barron, J. Rissanen, and B. Yu, The Minimum Description Length Principle in Coding and Modeling, IEEE Trans. Information Theory, 44, 2743\u20132760, 1998.","journal-title":"IEEE Trans. Information Theory"},{"key":"29_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"T. Cover and J.A. Thomas, Elements of Information Theory, John Wiley & Sons, New York 1991."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0019-9958(65)90332-3","volume":"8","author":"L. Campbell","year":"1965","unstructured":"L. Campbell, A Coding Theorem and R\u00e9nyi\u2019s Entropy, Information and Control, 8, 423\u2013429, 1965.","journal-title":"Information and Control"},{"key":"29_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0093404","volume-title":"Sequences, Discrepancies, and Applications","author":"M. Drmota","year":"1997","unstructured":"M. Drmota and R. Tichy, Sequences, Discrepancies, and Applications, Springer Verlag, Berlin Heidelberg, 1997."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"6","author":"D. E. Knuth","year":"1985","unstructured":"D. E. Knuth, Dynamic Huffman Coding, J. Algorithms, 6, 163\u2013180, 1985.","journal-title":"J. Algorithms"},{"key":"29_CR7","unstructured":"E. Kr\u00e4tzel, Lattice Points, Kluwer, Dordrecht, 1988."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/S0019-9958(75)90404-0","volume":"29","author":"P. Nath","year":"1975","unstructured":"P. Nath, On a Coding Theorem Connected with R\u00e9nyi\u2019s Entropy, Information and Control, 29, 234\u2013242, 1975.","journal-title":"Information and Control"},{"key":"29_CR9","first-page":"382","volume":"76","author":"J. Leeuwen","year":"1976","unstructured":"J. van Leeuwen, On the Construction of the Huffman Trees, Proc. ICALP\u201976, 382\u2013410, 1976.","journal-title":"Proc. ICALP\u2019"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1109\/TIT.1984.1056936","volume":"30","author":"J. Rissanen","year":"1984","unstructured":"J. Rissanen, Complexity of Strings in the Class of MarkovSo urces, IEEE Trans. Information Theory, 30, 526\u2013532, 1984.","journal-title":"IEEE Trans. Information Theory"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.481776","volume":"42","author":"J. Rissanen","year":"1996","unstructured":"J. Rissanen, Fisher Information and Stochastic Complexity, IEEE Trans. Information Theory, 42, 40\u201347, 1996.","journal-title":"IEEE Trans. Information Theory"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/18.212281","volume":"39","author":"P. Shields","year":"1993","unstructured":"P. Shields, Universal Redundancy Rates Do Not Exist, IEEE Trans. Information Theory, 39, 520\u2013524, 1993.","journal-title":"IEEE Trans. Information Theory"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/0209035","volume":"9","author":"D. S. Parker","year":"1980","unstructured":"D. S. Parker, Conditions for Optimiality of the Hu.man Algorithm, SIAM J. Compt., 9, 470\u2013489, 1980.","journal-title":"SIAM J. Compt."},{"key":"29_CR14","first-page":"175","volume":"23","author":"Y. Shtarkov","year":"1987","unstructured":"Y. Shtarkov, Universal Sequential Coding of Single Messages, Problems of Information Transmission, 23, 175\u2013186, 1987.","journal-title":"Problems of Information Transmission"},{"issue":"2","key":"29_CR15","first-page":"55","volume":"34","author":"W. Szpankowski","year":"1998","unstructured":"W. Szpankowski, On Asymptotics of Certain Recurrences Arising in Universal Coding, Problems of Information Transmission, 34, No.2, 55\u201361, 1998.","journal-title":"Problems of Information Transmission"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1109\/18.887856","volume":"46","author":"W. Szpankowski","year":"2000","unstructured":"W. Szpankowski, Asymptotic Redundancy of Hu.man (and Other) Block Codes, IEEE Trans. Information Theory, 46, 2434\u20132443, 2000.","journal-title":"IEEE Trans. Information Theory"},{"key":"29_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770","volume-title":"Average Case Analysis of Algorithms on Sequences","author":"W. Szpankowski","year":"2001","unstructured":"W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 2001."},{"key":"29_CR18","first-page":"647","volume":"43","author":"Q. Xie","year":"1997","unstructured":"Q. Xie, A. Barron, Minimax Redundancy for the Class of Memoryless Sources, IEEE Trans. Information Theory, 43, 647\u2013657, 1997.","journal-title":"IEEE Trans. Information Theory"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/18.825803","volume":"46","author":"Q. Xie","year":"2000","unstructured":"Q. Xie, A. Barron, Asymptotic Minimax Regret for Data Compression, Gambling, and Prediction, IEEE Trans. Information Theory, 46, 431\u2013445, 2000.","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T00:15:10Z","timestamp":1550362510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}