{"id":"https://openalex.org/W613405085","doi":null,"title":"A Balanced Binary Search Tree for Huffman Decoding","display_name":"A Balanced Binary Search Tree for Huffman Decoding","publication_year":2005,"publication_date":"2005-05-01","ids":{"openalex":"https://openalex.org/W613405085","mag":"613405085"},"language":"en","primary_location":{"id":"mag:613405085","doi":null,"is_oa":false,"landing_page_url":"https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE01731713","pdf_url":null,"source":{"id":"https://openalex.org/S4306496539","display_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","issn_l":"1226-4717","issn":["1226-4717","2287-3880"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The Journal of Korean Institute of Communications and Information Sciences","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5027404609","display_name":"Hyesook Lim","orcid":"https://orcid.org/0000-0001-9857-937X","observed_orcids":["https://orcid.org/0000-0001-9857-937X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hyesook Lim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032401374","display_name":"Hye Ran Kim","orcid":"https://orcid.org/0000-0002-0658-3345","observed_orcids":["https://orcid.org/0000-0002-0658-3345"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hye Ran Kim","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0658-3345","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042996786","display_name":"Ju Hyoung Mun","orcid":"https://orcid.org/0000-0002-6425-6684","observed_orcids":["https://orcid.org/0000-0002-6425-6684"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juhyung Mun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024550177","display_name":"Changhoon Yim","orcid":"https://orcid.org/0000-0002-3826-6395","observed_orcids":["https://orcid.org/0000-0002-3826-6395"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Changhoon Yim","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3826-6395","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"30","issue":null,"first_page":"385","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10741","display_name":"Video Coding and Compression Technologies","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-decoding","display_name":"Huffman decoding","score":0.9860000014305115},{"id":"https://openalex.org/keywords/balanced-binary-search-trees","display_name":"balanced binary search trees","score":0.996999979019165},{"id":"https://openalex.org/keywords/memory-access-efficiency","display_name":"memory access efficiency","score":0.6150000095367432},{"id":"https://openalex.org/keywords/image-transmission","display_name":"image transmission","score":0.5879999995231628},{"id":"https://openalex.org/keywords/video-data-transmission","display_name":"video data transmission","score":0.7870000004768372},{"id":"https://openalex.org/keywords/real-time-decoding","display_name":"real-time decoding","score":0.609000027179718}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9444300532341003},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8265399932861328},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.7187356948852539},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6390104293823242},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5557653307914734},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5186623334884644},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46719810366630554},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4397910535335541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4392387270927429},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.364940881729126},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3418493866920471},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2566225230693817},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2401391863822937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2307313084602356},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18265730142593384},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.06812366843223572},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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":"mag:613405085","doi":null,"is_oa":false,"landing_page_url":"https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE01731713","pdf_url":null,"source":{"id":"https://openalex.org/S4306496539","display_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","issn_l":"1226-4717","issn":["1226-4717","2287-3880"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The Journal of Korean Institute of Communications and Information Sciences","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1865820856","https://openalex.org/W2236491335"],"related_works":["https://openalex.org/W2000710025","https://openalex.org/W1491329817","https://openalex.org/W1968477046","https://openalex.org/W2241192027","https://openalex.org/W7100914815","https://openalex.org/W2577009374","https://openalex.org/W2339233612","https://openalex.org/W2099094653","https://openalex.org/W1935337053","https://openalex.org/W857208173"],"abstract_inverted_index":{"Huffman":[0,41],"codes":[1],"are":[2],"widely":[3],"used":[4],"for":[5,40],"image":[6,97],"and":[7,25,43,82,110,117,124],"video":[8],"data":[9,98],"transmission.":[10],"As":[11],"the":[12,45,48,60,67,89,101,111],"increase":[13],"of":[14,19,47,53,59,62,107],"real-time":[15],"data,":[16],"a":[17,35,71],"lot":[18],"studies":[20],"on":[21,57],"effective":[22],"decoding":[23,42,112],"algorithms":[24],"architectures":[26],"have":[27],"been":[28],"done.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33],"proposed":[34,49,68,102],"balanced":[36,72],"binary":[37,73],"search":[38],"tree":[39,74],"compared":[44],"performance":[46],"architecture":[50,69,103],"with":[51,64],"that":[52,100],"previous":[54],"works.":[55],"Based":[56],"definitions":[58],"comparison":[61],"codewords":[63],"different":[65],"lengths,":[66],"constructs":[70],"which":[75],"does":[76],"not":[77],"include":[78],"empty":[79],"internal":[80],"nodes,":[81],"hence":[83],"it":[84],"is":[85,114],"very":[86],"efficient":[87],"in":[88,121],"memory":[90,119],"requirement.":[91],"Performance":[92],"evaluation":[93],"results":[94],"using":[95],"actual":[96],"show":[99],"requires":[104],"small":[105],"number":[106],"table":[108],"entries,":[109],"time":[113],"1,":[115],"5,":[116],"2.41":[118],"accesses":[120],"minimum,":[122],"maximum,":[123],"average,":[125],"respectively.":[126]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-10-31T12:09:11.096373","created_date":"2016-06-24T00:00:00"}