{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:04:25Z","timestamp":1761807865066},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/tit.2013.2294832","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:50:19Z","timestamp":1391190619000},"page":"1412-1427","source":"Crossref","is-referenced-by-count":8,"title":["Huffman Redundancy for Large Alphabet Sources"],"prefix":"10.1109","volume":"60","author":[{"given":"Hamed","family":"Narimani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadali","family":"Khosravifard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E94.A.2092"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055357"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.887856"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8643-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055554"},{"key":"ref15","author":"rudin","year":"1976","journal-title":"Principles of Mathematical Analysis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.108260"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.87001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.825026"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2132","DOI":"10.1109\/TIT.2002.1013158","article-title":"A simple upper bound on the redundancy of Huffman codes","volume":"48","author":"ye","year":"2002","journal-title":"IEEE Trans Inf Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2216975"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208580"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/18.42226","article-title":"Tight upper bounds on the redundancy of Huffman codes","volume":"35","author":"santis","year":"1989","journal-title":"IEEE Trans Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1109\/TIT.2006.890782","article-title":"The minimum average code for memoryless monotone sources","volume":"53","author":"khosravifard","year":"2008","journal-title":"IEEE Trans Inf Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6739111\/06681930.pdf?arnumber=6681930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:39Z","timestamp":1642005099000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6681930\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":15,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2294832","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}