{"id":"https://openalex.org/W857208173","doi":null,"title":"Efficient Huffman decoder using octal tree search algorithm","display_name":"Efficient Huffman decoder using octal tree search algorithm","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W857208173","mag":"857208173"},"language":"en","primary_location":{"id":"mag:1891906141","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/NODE00214680","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":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","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/A5067554878","display_name":"\uc6b0\uad11\ud76c","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\uc6b0\uad11\ud76c","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037617095","display_name":"\ud55c\ud5cc\uc218","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\uae40\uad6c\uc6a9","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037617095","display_name":"\ud55c\ud5cc\uc218","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\ud55c\ud5cc\uc218","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085276637","display_name":"\ucc28\ud615\ud0dc","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\ucc28\ud615\ud0dc","raw_affiliation_strings":[],"raw_orcid":null,"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":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"12","first_page":"2033","last_page":"2033"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"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.9976000189781189,"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.0024999999441206455,"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.9940000176429749},{"id":"https://openalex.org/keywords/hardware-implementation","display_name":"hardware implementation","score":0.8640000224113464},{"id":"https://openalex.org/keywords/data-compression","display_name":"data compression","score":0.7390000224113464},{"id":"https://openalex.org/keywords/decoding-speed","display_name":"decoding speed","score":0.43299999833106995}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9783596992492676},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.9070421457290649},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7442249059677124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7376396059989929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6156636476516724},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.498462438583374},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.4814590811729431},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4438793659210205},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.42960137128829956},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.0},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1891906141","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/NODE00214680","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":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","raw_type":null},{"id":"mag:857208173","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=GCSHCI_2000_v25n12_2033","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":0,"referenced_works":[],"related_works":["https://openalex.org/W1966119657","https://openalex.org/W2106114780","https://openalex.org/W2318282252","https://openalex.org/W2354684312","https://openalex.org/W1968477046","https://openalex.org/W2025845352","https://openalex.org/W2745874579","https://openalex.org/W1999484569","https://openalex.org/W2137416304","https://openalex.org/W2351426775"],"abstract_inverted_index":{"Huffman":[0,25,34,39,45,78],"coding":[1],"which":[2,48],"has":[3,21,62],"been":[4,22],"used":[5,49],"in":[6],"many":[7,85],"data":[8,13],"compression":[9,14],"algorithms":[10],"is":[11,71],"popular":[12],"technique":[15],"to":[16],"reduce":[17],"statistical":[18],"redundancy.":[19],"It":[20],"proposed":[23],"that":[24],"decoding":[26,46,79],"algorithm":[27,47,61,80],"can":[28,81],"decode":[29],"efficiently":[30],"using":[31],"characteristics":[32],"of":[33,38],"tables":[35],"and":[36,54,67,70],"patterns":[37],"codewords.":[40],"We":[41],"propose":[42],"a":[43,63],"new":[44],"octal":[50],"tree":[51],"search":[52],"technique,":[53],"present":[55],"efficient":[56],"hardware":[57],"implementation":[58],"method.":[59],"This":[60],"small":[64],"logic":[65],"area":[66],"memory":[68],"space,":[69],"optimized":[72],"for":[73,84],"high":[74],"speed":[75],"decoding.":[76],"Proposed":[77],"be":[82],"applied":[83],"multimedia":[86],"systems":[87],"such":[88],"as":[89],"MPEG":[90],"audio":[91],"decoder.":[92]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2016-06-24T00:00:00"}