{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:31Z","timestamp":1773377971065,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517894","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2024-2029","source":"Crossref","is-referenced-by-count":5,"title":["On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels"],"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":"Xishi","family":"Wang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]},{"given":"Ka Hei","family":"Ng","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]},{"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universitat Erlangen-Ntirnberg,Chair of Applied Cryptography"}]},{"given":"Lucien K. L.","family":"Ng","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Physics"}]},{"given":"Jack P. K.","family":"Ma","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849758"},{"key":"ref3","article-title":"On multi-channel Huffman codes for asymmetric-alphabet channels","author":"yin","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510020"},{"key":"ref8","first-page":"382","article-title":"On the construction of Huffman trees","author":"van leeuwen","year":"1976","journal-title":"International Colloquium on Automata Languages and Programming (ICALP)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.79933"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503211"},{"key":"ref9","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517894.pdf?arnumber=9517894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:43Z","timestamp":1773347743000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517894\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517894","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}