{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:32Z","timestamp":1773377672492,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834710","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes"],"prefix":"10.1109","author":[{"given":"Hoover H. F.","family":"Yin","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Institute of Network Coding"}]},{"given":"Harry W. H.","family":"Wong","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]},{"given":"Mehrdad","family":"Tahernia","sequence":"additional","affiliation":[{"name":"Independent Researcher"}]},{"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universität Erlangen-Nürnberg,Chair of Applied Cryptography"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620529"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref12","first-page":"382","article-title":"On the construction of Huffman trees","author":"van leeuwen","year":"1976","journal-title":"ICALP"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.641571"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708830"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262089"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595329"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503211"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849758"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611502"},{"key":"ref4","first-page":"43","article-title":"Hello world or ????µ??? ???µ? or S+! \/ã~","author":"pike","year":"1993","journal-title":"in Proceedings of the Winter 1993 USENIX Conference"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3629"},{"key":"ref6","author":"fano","year":"1949","journal-title":"The Transmission of Information"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1147\/rd.203.0198"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref2","article-title":"List of recommendation ITU-T E.164 assigned country codes","year":"2011"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834710"},{"key":"ref9","article-title":"Source coding algorithms for fast data compression","author":"pasco","year":"1976","journal-title":"Ph D Dissertation"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517894"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834710.pdf?arnumber=9834710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:49Z","timestamp":1773347689000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834710\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834710","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}