{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:12:37Z","timestamp":1761808357218,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/tit.2020.2987309","type":"journal-article","created":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T05:51:56Z","timestamp":1586843516000},"page":"4419-4430","source":"Crossref","is-referenced-by-count":4,"title":["Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5888-9808","authenticated-orcid":false,"given":"Mohammad","family":"Javad-Kalbasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0645-7285","authenticated-orcid":false,"given":"Mohammadali","family":"Khosravifard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.42226"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.108260"},{"journal-title":"Introduction to Information Theory","year":"1961","author":"reza","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)80011-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.87001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(95)00220-0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.79933"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057266"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008273408148"},{"key":"ref19","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":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836703"},{"key":"ref3","first-page":"20","article-title":"Some properties of fix free codes","author":"ahlswede","year":"1996","journal-title":"Proc 1st Int Sem Coding Theory Combinatorics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2425405"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2189433"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056158"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055959"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196490"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057239"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.108260"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558667"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323797"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053968"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9120400\/09064656.pdf?arnumber=9064656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:20:37Z","timestamp":1651080037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9064656\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":23,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2987309","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2020,7]]}}}