{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:36Z","timestamp":1794516756687,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_633","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:35Z","timestamp":1461269015000},"page":"938-942","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Huffman Coding"],"prefix":"10.1007","author":[{"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"3","key":"633_CR8157","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0020-0190(84)90021-8","volume":"18","author":"GV Cormack","year":"1984","unstructured":"Cormack GV, Horspool RN (1984) Algorithms for adaptive Huffman codes. Inf Process Lett 18(3):159\u2013165","journal-title":"Inf Process Lett"},{"issue":"6","key":"633_CR8158","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"IT-24","author":"RG Gallager","year":"1978","unstructured":"Gallager RG (1978) Variations on a theme by Huffman. IEEE Trans Inf Theory IT-24(6):668\u2013674","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"633_CR8159","first-page":"1098","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman DA (1952) A method for the construction of minimum-redundancy codes. Proc Inst Radio Eng 40(9):1098\u20131101","journal-title":"Proc Inst Radio Eng"},{"issue":"2","key":"633_CR8160","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"6","author":"DE Knuth","year":"1985","unstructured":"Knuth DE (1985) Dynamic Huffman coding. J Algorithms 6(2):163\u2013180","journal-title":"J Algorithms"},{"key":"633_CR8161","first-page":"393","volume-title":"In-place calculation of minimum-redundancy codes","author":"A Moffat","year":"1995","unstructured":"Moffat A, Katajainen J (1995) In-place calculation of minimum-redundancy codes. In: Proceedings of the Workshop on Algorithms and Data Structures, Kingston, pp\u00a0393\u2013402"},{"issue":"10","key":"633_CR8162","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/26.634683","volume":"45","author":"A Moffat","year":"1997","unstructured":"Moffat A, Turpin A (1997) On the implementation of minimum-redundancy prefix codes. IEEE Trans Commun 45(10):1200\u20131207","journal-title":"IEEE Trans Commun"},{"key":"633_CR8163","doi-asserted-by":"crossref","unstructured":"Stix G (1991) Profile: information theorist David\u00a0A. Huffman. Sci Am 265(3):54\u201358. Reproduced at http:\/\/www.huffmancoding.com\/my-uncle\/david-bio. Accessed 15 July 2014","DOI":"10.1038\/scientificamerican0991-54"},{"issue":"4","key":"633_CR8164","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/26.843129","volume":"48","author":"A Turpin","year":"2000","unstructured":"Turpin A, Moffat A (2000) Housekeeping for prefix coding. IEEE Trans Commun 48(4):622\u2013628","journal-title":"IEEE Trans Commun"},{"issue":"1","key":"633_CR8165","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/18.904514","volume":"47","author":"A Turpin","year":"2001","unstructured":"Turpin A, Moffat A (2001) On-line adaptive canonical prefix coding with bounded compression loss. IEEE Trans Inf Theory 47(1):88\u201398","journal-title":"IEEE Trans Inf Theory"},{"key":"633_CR8166","first-page":"382","volume-title":"Proceedings of the International Conference on Automata, Languages, and Programming","author":"J van Leeuwen","year":"1976","unstructured":"van Leeuwen J (1976) On the construction of Huffman trees. In: Proceedings of the International Conference on Automata, Languages, and Programming, Edinburgh University, Edinburgh, pp\u00a0382\u2013410"},{"issue":"4","key":"633_CR8167","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"JS Vitter","year":"1987","unstructured":"Vitter JS (1987) Design and analysis of dynamic Huffman codes. J ACM 34(4):825\u2013845","journal-title":"J ACM"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:45:36Z","timestamp":1792107936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_633","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}