{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:18:56Z","timestamp":1730279936665,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1109\/iwcit.2014.6842508","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T21:23:33Z","timestamp":1406582613000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["A note on the redundancy of reversible variable length codes"],"prefix":"10.1109","author":[{"given":"Sayed Jalal","family":"Zahabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadali","family":"Khosravifard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","article-title":"93 % of the 3 4 conjecture is already verified","author":"aghajan","year":"2014","journal-title":"IEEE Trans Inform Theory"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1109\/TIT.1978.1055959"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1109\/DCC.2009.39"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/TIT.2012.2189433"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/ITW2.2006.323797"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/CISS.2008.4558667"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/18.904513"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/TIT.2004.836703"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"12","first-page":"2033","article-title":"Some properties of fix-free codes","author":"ahlswede","year":"1996","journal-title":"Proc 1st Int Sem Coding Theory Combinatorics"},{"key":"21","article-title":"Sufficient conditions of existence of fix-free codes","author":"yekhanin","year":"2001","journal-title":"Proc IEEE Int Symp Inform Theory"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1109\/TCSVT.2002.808434"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1109\/TIT.2010.2046244"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/35.685373"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/26.380026"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/TIT.2012.2208580"},{"key":"7","article-title":"On the average codeword length of optimal binary codes for extended sources","volume":"it 33","author":"montogomery","year":"1987","journal-title":"IEEE Trans Inform Theory"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/TIT.1980.1056158"},{"year":"2006","author":"cover","journal-title":"Elements of Information Theory","key":"5"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/TIT.2012.2196490"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/18.108260"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/18.87001"}],"event":{"name":"2014 Iran Workshop on Communication and Information Theory (IWCIT)","start":{"date-parts":[[2014,5,7]]},"location":"Tehran, Iran","end":{"date-parts":[[2014,5,8]]}},"container-title":["2014 Iran Workshop on Communication and Information Theory (IWCIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6830039\/6842477\/06842508.pdf?arnumber=6842508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T20:28:30Z","timestamp":1490300910000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6842508\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/iwcit.2014.6842508","relation":{},"subject":[],"published":{"date-parts":[[2014,5]]}}}