{"id":"https://openalex.org/W2367418279","doi":null,"title":"Another Algorithm of Huffman Coding","display_name":"Another Algorithm of Huffman Coding","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2367418279","mag":"2367418279"},"language":"en","primary_location":{"id":"mag:2367418279","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-AFJY200606012.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Anhui Institute of Education","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/A5075120505","display_name":"Wang Qun-fang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wang Qun-fang","raw_affiliation_strings":["Department of Computer Science,Anhui Institute of Education,Hefei 230061,China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science,Anhui Institute of Education,Hefei 230061,China)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5075120505"],"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":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.0,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":1.0},{"id":"https://openalex.org/keywords/binary-trees","display_name":"binary trees","score":0.7490000128746033},{"id":"https://openalex.org/keywords/code-assignment","display_name":"code assignment","score":0.7630000114440918},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.5609999895095825},{"id":"https://openalex.org/keywords/text-compression","display_name":"text compression","score":0.46000000834465027},{"id":"https://openalex.org/keywords/decoding","display_name":"decoding","score":0.4009999930858612}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9876276254653931},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.8238217234611511},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.8163036108016968},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.6968159079551697},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.637975811958313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.594507098197937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5753368139266968},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5643709301948547},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5640440583229065},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5608883500099182},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.445119172334671},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.42408493161201477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4190915822982788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2965959906578064},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2714255750179291},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.1955106556415558},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.11895701289176941},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10489839315414429},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.059853702783584595},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2367418279","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-AFJY200606012.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Anhui Institute of Education","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/W2000710025","https://openalex.org/W2393846133","https://openalex.org/W1968477046","https://openalex.org/W2357592672","https://openalex.org/W2105230838","https://openalex.org/W2347638464","https://openalex.org/W1500228807","https://openalex.org/W2379652943","https://openalex.org/W2367665007","https://openalex.org/W7100914815"],"abstract_inverted_index":{"Traditional":[0],"Huffman":[1,34,90],"coding":[2,35,80],"is":[3,63],"structured":[4],"in":[5,17,21,76,87],"the":[6,11,45,55,58,71,77,88],"way":[7],"of":[8,33,48,57,79],"tree":[9,25,38,50],"pattern,using":[10],"chain":[12,15],"or":[13],"static":[14],"structure":[16],"algorithm,and":[18],"every":[19],"node":[20],"space":[22,74],"has":[23],"left,right":[24],"and":[26,81],"parents":[27],"pointers.This":[28],"paper":[29],"presents":[30],"another":[31],"algorithm":[32],"which":[36],"removes":[37],"pattern":[39],"structure,using":[40],"an":[41],"array":[42],"to":[43,53,68],"simulate":[44],"creation":[46],"process":[47,78],"binary":[49],"so":[51],"as":[52],"obtain":[54],"depth":[56],"symbol,and":[59],"then":[60],"each":[61],"symbol":[62],"assigned":[64],"a":[65],"code":[66],"according":[67],"this":[69],"information.For":[70],"full-length":[72],"text,the":[73],"needed":[75],"decoding":[82],"will":[83],"much":[84],"less":[85],"than":[86],"traditional":[89],"coding.":[91]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2016-06-24T00:00:00"}