{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T18:33:45Z","timestamp":1766428425540,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T00:00:00Z","timestamp":1655337600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T00:00:00Z","timestamp":1655337600000},"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,16]]},"DOI":"10.1109\/comm54429.2022.9817335","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T19:41:28Z","timestamp":1657741288000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["Fast Canonical Huffman Decoder"],"prefix":"10.1109","author":[{"given":"Sabin","family":"Belu","sequence":"first","affiliation":[{"name":"Doctoral School ETTI, Univ. Politehnica of Bucharest,Bucharest,Romania"}]},{"given":"Daniela","family":"Coltuc","sequence":"additional","affiliation":[{"name":"Univ. Politehnica of Bucharest,Faculty of Electronics Tc. and Information Technology,Bucharest,Romania"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/77556.77566"},{"key":"ref11","article-title":"A memory-efficient Huffman decoding algorithm","volume":"1","author":"wang","year":"0","journal-title":"Published in 19th International Conference on Advanced Information Networking and Applications (AINA'05)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1186\/s40535-016-0032-z"},{"key":"ref13","article-title":"Design and Implementation of Huffman Decoder for Text data Compression","volume":"5","author":"swapna","year":"2015","journal-title":"International Journal of Current Engineering and Technology"},{"journal-title":"Huff-0","year":"0","author":"collet","key":"ref14"},{"journal-title":"zHuff","year":"0","author":"collet","key":"ref15"},{"year":"0","author":"collet","key":"ref16"},{"journal-title":"National Center for Biotechnology Information National Library of Medicine","year":"0","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/63334.63341"},{"journal-title":"Range-0","year":"0","author":"collet","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref3","article-title":"The transmission of information","author":"fano","year":"1949","journal-title":"Technical Report 65 Cambridge Mass Research Laboratory of Electronics M I T"},{"key":"ref6","first-page":"237","article-title":"Fast Decoding of the Huffman codes","author":"sieminskly","year":"198","journal-title":"Information Processing Letters"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3342555"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITCC.2003.1197527"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057265"},{"key":"ref2","article-title":"The Art of Computer Programming","volume":"3","author":"knuth","year":"1973","journal-title":"Sorting and Searching"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"huffman","year":"0","journal-title":"Proc of the IRE"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/26.634683"},{"journal-title":"Huff-X","year":"0","author":"collet","key":"ref20"},{"journal-title":"zlib Library","year":"0","author":"gailly","key":"ref22"},{"key":"ref21","article-title":"Range encoding: An algorithm for removing redun-dancy from a digitized message","author":"martin","year":"1979","journal-title":"Video & Data Recording Conference"}],"event":{"name":"2022 14th International Conference on Communications (COMM)","start":{"date-parts":[[2022,6,16]]},"location":"Bucharest, Romania","end":{"date-parts":[[2022,6,18]]}},"container-title":["2022 14th International Conference on Communications (COMM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9817096\/9817149\/09817335.pdf?arnumber=9817335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:42:01Z","timestamp":1659660121000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9817335\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,16]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/comm54429.2022.9817335","relation":{},"subject":[],"published":{"date-parts":[[2022,6,16]]}}}