{"id":"https://openalex.org/W2188010542","doi":null,"title":"Ternary Tree and Clustering Based Huffman Coding Algorithm","display_name":"Ternary Tree and Clustering Based Huffman Coding Algorithm","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2188010542","mag":"2188010542"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.402.9310","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.9310","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ijcsi.org/papers/7-5-394-398.pdf","raw_type":"text"},"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/A5110284449","display_name":"Pushpa R. Suri","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pushpa R. Suri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028881411","display_name":"Madhu Goel","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhu Goel","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.7006,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68141593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"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":0.8820000290870667},{"id":"https://openalex.org/keywords/ternary-trees","display_name":"ternary trees","score":0.890999972820282},{"id":"https://openalex.org/keywords/codeword-length","display_name":"codeword length","score":0.9589999914169312},{"id":"https://openalex.org/keywords/frequency-tables","display_name":"frequency tables","score":0.7110000252723694},{"id":"https://openalex.org/keywords/space-efficient-data-structures","display_name":"space-efficient data structures","score":0.9139999747276306},{"id":"https://openalex.org/keywords/data-compression","display_name":"data compression","score":0.5759999752044678}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9471749067306519},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.7186850309371948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6600407958030701},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.581232488155365},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.560109555721283},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.5051689743995667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5019185543060303},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49670082330703735},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.48036155104637146},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4667786657810211},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.4443354308605194},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4334624111652374},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3590247929096222},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3369676470756531},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.30536508560180664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.287595272064209},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.23437738418579102},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1682133674621582},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.13232991099357605},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11869898438453674},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09145882725715637},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.09130686521530151},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06762313842773438},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.060239970684051514}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.402.9310","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.9310","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ijcsi.org/papers/7-5-394-398.pdf","raw_type":"text"},{"id":"mag:2188010542","doi":null,"is_oa":false,"landing_page_url":"http://www.ijcsi.org/papers/7-5-394-398.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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":14,"referenced_works":["https://openalex.org/W1484014009","https://openalex.org/W1975965284","https://openalex.org/W1981134600","https://openalex.org/W1993449345","https://openalex.org/W2038649859","https://openalex.org/W2080767424","https://openalex.org/W2085880494","https://openalex.org/W2129503320","https://openalex.org/W2146339427","https://openalex.org/W2149194506","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W3004540582","https://openalex.org/W3140968660"],"related_works":["https://openalex.org/W7099101926","https://openalex.org/W2339233612","https://openalex.org/W2149194506","https://openalex.org/W2146339427","https://openalex.org/W2129503320","https://openalex.org/W7100914815","https://openalex.org/W1968477046","https://openalex.org/W1497604840","https://openalex.org/W2099094653","https://openalex.org/W2347638464"],"abstract_inverted_index":{"In":[0,29,199],"this":[1,30,103,200],"study,":[2],"the":[3,7,37,41,46,59,65,76,96,107,114,119,125,133,137,140,164,169,173,192,207,210,213,217],"focus":[4],"was":[5,27,53,62],"on":[6],"use":[8,71],"of":[9,40,48,171,195,209,212],"ternary":[10,24,197],"tree":[11,25],"over":[12],"binary":[13],"tree.":[14,78,198,218],"Here,":[15],"a":[16,54,144,177,180,185],"new":[17],"two":[18,55],"pass":[19,56,61],"Algorithm":[20],"for":[21,176],"encoding":[22,52,138],"Huffman":[23,49,51,77,145,181,196],"codes":[26],"implemented.":[28],"algorithm":[31,201],"we":[32,183,202],"tried":[33,203],"to":[34,63,70,74,85,91,101,111,122,190,204],"find":[35,205],"out":[36,206],"codeword":[38,174,193],"length":[39,175,194,208],"symbol.":[42],"Here":[43,58],"I":[44,94],"used":[45,215],"concept":[47],"encoding.":[50],"problem.":[57],"first":[60],"collect":[64],"letter":[66],"frequencies.":[67],"You":[68],"need":[69,90],"that":[72,80],"information":[73],"create":[75],"Note":[79],"char":[81],"values":[82],"range":[83,108],"from-128":[84],"127,":[86],"so":[87],"you":[88],"will":[89],"cast":[92],"them.":[93],"stored":[95],"data":[97,150,188],"as":[98],"unsigned":[99],"chars":[100],"solve":[102],"problem,":[104],"and":[105,117,135,167],"then":[106],"is":[109],"0":[110],"255.":[112],"Open":[113,124],"output":[115,141],"file":[116],"write":[118],"frequency":[120],"table":[121],"it.":[123],"input":[126],"file,":[127],"read":[128],"characters":[129],"from":[130],"it,":[131],"gets":[132],"codes,":[134],"writes":[136],"into":[139],"file.":[142],"Once":[143],"code":[146,211],"has":[147],"been":[148],"generated,":[149],"may":[151],"be":[152],"encoded":[153],"simply":[154],"by":[155],"replacing":[156],"each":[157],"symbol":[158,178],"with":[159],"its":[160],"code.":[161],"To":[162],"reduce":[163],"memory":[165,186],"size":[166],"fasten":[168],"process":[170],"finding":[172],"in":[179,216],"tree,":[182],"proposed":[184],"efficient":[187],"structure":[189],"represent":[191],"symbols":[214]},"counts_by_year":[{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}