{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:08:04Z","timestamp":1648631284910},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"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,11]]},"DOI":"10.1109\/tit.2015.2477822","type":"journal-article","created":{"date-parts":[[2015,9,10]],"date-time":"2015-09-10T18:50:27Z","timestamp":1441911027000},"page":"6385-6394","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Codes With Limited Kraft Sum"],"prefix":"10.1109","volume":"61","author":[{"given":"Adel","family":"Aghajan","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.1109\/IWCIT.2014.6842508"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054058"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054638"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90149-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90137-3"},{"key":"ref15","first-page":"2510","article-title":"A tree based algorithm for generating all possible binary compact codes with N codewords","volume":"e86 a","author":"khosravifard","year":"2003","journal-title":"IEICE Trans Fundam"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2226560"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280211"},{"key":"ref4","first-page":"20","article-title":"Some properties of fix-free codes","author":"ahlswede","year":"1996","journal-title":"Proc 1st Int Seminar on Coding Theory and Combinatorics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055959"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046244"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836703"},{"key":"ref8","article-title":"On the $\\frac {3}{4}$ -conjecture for fix-free codes—A survey","author":"schnettler","year":"2007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338052"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref1","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2189433"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7299738\/07254175.pdf?arnumber=7254175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:45:42Z","timestamp":1642005942000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7254175\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":17,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2477822","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}