{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:05:42Z","timestamp":1761807942621,"version":"3.37.3"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"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":[[2015,6]]},"DOI":"10.1109\/tit.2015.2425405","type":"journal-article","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T15:10:42Z","timestamp":1429715442000},"page":"3549-3558","source":"Crossref","is-referenced-by-count":5,"title":["The Redundancy of an Optimal Binary Fix-Free Code Is Not Greater Than 1 bit"],"prefix":"10.1109","volume":"61","author":[{"given":"Shima","family":"Kheradmand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadali","family":"Khosravifard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9919-0323","authenticated-orcid":false,"given":"T.","family":"Aaron Gulliver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836703"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323797"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2189433"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2009.39"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.108260"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT.2014.6842508"},{"key":"ref16","first-page":"20","article-title":"Some properties of fix-free codes","author":"ahlswede","year":"1996","journal-title":"Proc 1st Int Sem Coding Theory Combin"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280211"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046244"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2003.815168"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.091710.0901872"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196490"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055959"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1678121"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.815660"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.904513"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7109216\/07091921.pdf?arnumber=7091921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:47:42Z","timestamp":1641988062000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7091921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":18,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2425405","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}