{"id":"https://openalex.org/W2043854675","doi":"https://doi.org/10.1142/s0129053395000245","title":"ON OPTIMAL WEIGHTED BINARY TREES","display_name":"ON OPTIMAL WEIGHTED BINARY TREES","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W2043854675","doi":"https://doi.org/10.1142/s0129053395000245","mag":"2043854675"},"language":"en","primary_location":{"id":"doi:10.1142/s0129053395000245","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053395000245","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","raw_type":"journal-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/A5113332134","display_name":"Jatin Kumar Pradhan","orcid":null},"institutions":[{"id":"https://openalex.org/I90752740","display_name":"Berhampur University","ror":"https://ror.org/03m3xkg41","country_code":"IN","type":"education","lineage":["https://openalex.org/I90752740"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"J. PRADHAN","raw_affiliation_strings":["Department of Computer Science, Berhampur University,  Berhampur, Gangam, Orissa, India - 760007, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Berhampur University,  Berhampur, Gangam, Orissa, India - 760007, India","institution_ids":["https://openalex.org/I90752740"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108272215","display_name":"Ch. V. Sastry","orcid":null},"institutions":[{"id":"https://openalex.org/I16292982","display_name":"National Institute of Technology Rourkela","ror":"https://ror.org/011gmn932","country_code":"IN","type":"education","lineage":["https://openalex.org/I16292982"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C.V. SASTRY","raw_affiliation_strings":["Department of Computer science Engineering and Applications, Regional Engineering College, Rourkela, Orissa, India - 769008, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer science Engineering and Applications, Regional Engineering College, Rourkela, Orissa, India - 769008, India","institution_ids":["https://openalex.org/I16292982"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113332134"],"corresponding_institution_ids":["https://openalex.org/I90752740"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13899966,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"07","issue":"03","first_page":"445","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"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.9991000294685364,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9811000227928162,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.972000002861023,"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.8729251623153687},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.8662393093109131},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6856652498245239},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.5864418745040894},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.540432870388031},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5148491263389587},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5035895705223083},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49010929465293884},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4661117196083069},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.45443788170814514},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43106839060783386},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.4305768311023712},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43010738492012024},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42828524112701416},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32530471682548523},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.29038292169570923},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.28001630306243896},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.22985634207725525},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.1453995406627655},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.11856326460838318},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.11220419406890869},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.09411677718162537},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.0872054398059845},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.060506343841552734}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8729251623153687},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.8662393093109131},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6856652498245239},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.5864418745040894},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.540432870388031},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5148491263389587},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5035895705223083},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49010929465293884},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4661117196083069},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.45443788170814514},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43106839060783386},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.4305768311023712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43010738492012024},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42828524112701416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32530471682548523},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29038292169570923},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.28001630306243896},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.22985634207725525},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.1453995406627655},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.11856326460838318},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.11220419406890869},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.09411677718162537},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0872054398059845},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.060506343841552734},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129053395000245","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053395000245","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2166346116","https://openalex.org/W4296567424","https://openalex.org/W3022794168","https://openalex.org/W1997112896","https://openalex.org/W4237802754","https://openalex.org/W2161081860","https://openalex.org/W2124738983","https://openalex.org/W2070947892","https://openalex.org/W2043854675","https://openalex.org/W2795037468"],"abstract_inverted_index":{"A":[0],"new":[1],"recursive":[2,83],"top-down":[3,82],"algorithm":[4,84],"for":[5,85],"the":[6,18,23,29,43,59,70,73,81],"construction":[7],"of":[8,48,58,72],"a":[9,50,67],"unique":[10,27],"Huffman":[11,24],"tree":[12,25],"is":[13,33,61],"introduced.":[14],"We":[15],"show":[16],"that":[17],"prefix":[19,51,74,88],"codes":[20],"generated":[21],"from":[22],"are":[26],"and":[28],"weighted":[30],"path":[31],"length":[32,45,71],"optimal.":[34],"Initially":[35],"we":[36,63,79],"have":[37,64],"not":[38],"imposed":[39],"any":[40],"restriction":[41,68],"on":[42,69],"maximum":[44],"(the":[46],"number":[47],"bits)":[49],"code":[52],"can":[53],"take.":[54],"But":[55],"if":[56],"buffering":[57],"source":[60],"required,":[62],"to":[65],"put":[66],"code.":[75],"In":[76],"this":[77],"context":[78],"extend":[80],"generating":[86],"length-limited":[87],"codes.":[89]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}