{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:01:54Z","timestamp":1761807714376},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"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":[[2012,6]]},"DOI":"10.1109\/tit.2012.2189433","type":"journal-article","created":{"date-parts":[[2012,3,5]],"date-time":"2012-03-05T15:13:50Z","timestamp":1330960430000},"page":"4049-4057","source":"Crossref","is-referenced-by-count":9,"title":["Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes"],"prefix":"10.1109","volume":"58","author":[{"given":"Mohammadali","family":"Khosravifard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shima","family":"Kheradmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046244"},{"key":"ref11","first-page":"2121","article-title":"A note on the fix-free code property","volume":"e82 a","author":"harada","year":"1999","journal-title":"IEICE Trans Fundam"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855581"},{"key":"ref13","first-page":"111","article-title":"On the 3\/4-conjecture for fix-free codes","volume":"ae","author":"deppe","year":"2005","journal-title":"DMTCS Proc Eur Conf Combinatorics Graph Theory Appl"},{"key":"ref14","author":"schnettler","year":"0","journal-title":"On the -Conjecture for Fix-Free Codes A Survey"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.904513"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323797"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558667"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055959"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/TIT.1987.1057280","article-title":"On the average codewords length of optimal binary codes for extended sources","volume":"it 33","author":"montgomery","year":"1987","journal-title":"IEEE Trans Inf Theory"},{"key":"ref4","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091710.0901872"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2009.39"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836703"},{"key":"ref7","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":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb01583.x"},{"key":"ref9","first-page":"284","article-title":"Sufficient conditions of existence of fix-free codes","author":"yekhanin","year":"2001","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056809"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056158"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2006.1633796"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.108260"},{"key":"ref24","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":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.87001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2010.22"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057239"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6200408\/06159084.pdf?arnumber=6159084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:55Z","timestamp":1633909915000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6159084\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":26,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2189433","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}