{"id":"https://openalex.org/W4285100796","doi":"https://doi.org/10.1109/comm54429.2022.9817335","title":"Fast Canonical Huffman Decoder","display_name":"Fast Canonical Huffman Decoder","publication_year":2022,"publication_date":"2022-06-16","ids":{"openalex":"https://openalex.org/W4285100796","doi":"https://doi.org/10.1109/comm54429.2022.9817335"},"language":"en","primary_location":{"id":"doi:10.1109/comm54429.2022.9817335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comm54429.2022.9817335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 14th International Conference on Communications (COMM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014019815","display_name":"Sabin Belu","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Sabin Belu","raw_affiliation_strings":["Doctoral School ETTI, Univ. Politehnica of Bucharest,Bucharest,Romania","Doctoral School ETTI, Univ. Politehnica of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Doctoral School ETTI, Univ. Politehnica of Bucharest,Bucharest,Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Doctoral School ETTI, Univ. Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019825441","display_name":"Daniela Col\u0163uc","orcid":"https://orcid.org/0000-0002-0237-7878"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Daniela Coltuc","raw_affiliation_strings":["Univ. Politehnica of Bucharest,Faculty of Electronics Tc. and Information Technology,Bucharest,Romania","Faculty of Electronics Tc. and Information Technology, Univ. Politehnica of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Univ. Politehnica of Bucharest,Faculty of Electronics Tc. and Information Technology,Bucharest,Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Faculty of Electronics Tc. and Information Technology, Univ. Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014019815"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.3979,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66087998,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9379000067710876,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9307000041007996,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.9741541147232056},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8692326545715332},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.7571194767951965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7253515720367432},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6750028729438782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4354480504989624},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3772164285182953},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.31396347284317017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20888078212738037},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11806273460388184},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.06767469644546509}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9741541147232056},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8692326545715332},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.7571194767951965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7253515720367432},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6750028729438782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4354480504989624},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3772164285182953},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.31396347284317017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20888078212738037},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11806273460388184},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.06767469644546509},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comm54429.2022.9817335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comm54429.2022.9817335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 14th International Conference on Communications (COMM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1556040792","https://openalex.org/W1979345064","https://openalex.org/W1995875735","https://openalex.org/W2016043756","https://openalex.org/W2017689508","https://openalex.org/W2029353114","https://openalex.org/W2060108852","https://openalex.org/W2096752629","https://openalex.org/W2099094653","https://openalex.org/W2108189215","https://openalex.org/W2573127017","https://openalex.org/W2577009374","https://openalex.org/W2752061190","https://openalex.org/W3162937989","https://openalex.org/W6674870896","https://openalex.org/W6744529318","https://openalex.org/W7009134052"],"related_works":["https://openalex.org/W1518463267","https://openalex.org/W2156080995","https://openalex.org/W2393846133","https://openalex.org/W2385622179","https://openalex.org/W2025845352","https://openalex.org/W4387740266","https://openalex.org/W2181792186","https://openalex.org/W2158701093","https://openalex.org/W4391249354","https://openalex.org/W2787192521"],"abstract_inverted_index":{"We":[0,79],"propose":[1],"a":[2,51],"novel":[3],"method":[4,22,32,64],"to":[5,12,92],"decode":[6,13],"canonical":[7,27,86],"Huffman":[8,28,87],"codes":[9],"specifically":[10,34],"designed":[11,35],"multiple":[14],"symbols":[15],"in":[16],"one":[17],"decoding":[18,31,43,70,103],"cycle.":[19],"The":[20],"encoding":[21],"used":[23],"is":[24,33],"the":[25,95,102],"classic":[26],"encoding.":[29],"Our":[30,63],"for":[36,69,84],"speed":[37],"and":[38,98],"provides":[39],"big":[40],"throughput":[41],"of":[42,54,101],"data;":[44],"within":[45],"our":[46],"tests,":[47],"we":[48],"have":[49],"achieved":[50],"decompression":[52],"output":[53],"more":[55],"than":[56],"2.1GiB/s":[57],"when":[58],"decompressing":[59],"highly":[60],"redundant":[61],"data.":[62],"holds":[65],"minimal":[66],"storage":[67],"requirements":[68],"tables":[71,104],"while":[72],"still":[73],"operating":[74],"at":[75],"very":[76],"high":[77],"speeds.":[78],"will":[80],"also":[81],"show":[82],"that":[83,89],"limited-length":[85],"codewords":[88],"extend":[90],"up":[91],"12":[93],"bits,":[94],"memory":[96],"size":[97],"construction":[99],"times":[100],"are":[105],"negligible.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}