{"id":"https://openalex.org/W2011506041","doi":"https://doi.org/10.1109/icassp.2002.5745161","title":"Optimal maximal and maximal prefix codes equivalent to Huffman codes","display_name":"Optimal maximal and maximal prefix codes equivalent to Huffman codes","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W2011506041","doi":"https://doi.org/10.1109/icassp.2002.5745161","mag":"2011506041"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2002.5745161","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2002.5745161","pdf_url":null,"source":{"id":"https://openalex.org/S4363607879","display_name":"IEEE International Conference on Acoustics Speech and Signal Processing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Acoustics Speech and Signal Processing","raw_type":"proceedings-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/A5102098296","display_name":"Dongyang Long","orcid":null},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Dongyang Long","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong, China","Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051803761","display_name":"Weijia Jia","orcid":"https://orcid.org/0000-0002-0231-3196"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Weijia Jia","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong, China","Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, China","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102098296"],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.13174807,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"40","issue":null,"first_page":"III","last_page":"2525"},"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/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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9962999820709229,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9865000247955322,"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.9651292562484741},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.9305291771888733},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.642052948474884},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.6298950910568237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.578990638256073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5206633806228638},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4382244646549225},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40545588731765747},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3996388912200928},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3857842683792114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37933191657066345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3289400339126587},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.2766842246055603},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.15623128414154053},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.15212616324424744},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12533986568450928}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9651292562484741},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.9305291771888733},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.642052948474884},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.6298950910568237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.578990638256073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5206633806228638},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4382244646549225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40545588731765747},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3996388912200928},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3857842683792114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37933191657066345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3289400339126587},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2766842246055603},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.15623128414154053},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.15212616324424744},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12533986568450928},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2002.5745161","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2002.5745161","pdf_url":null,"source":{"id":"https://openalex.org/S4363607879","display_name":"IEEE International Conference on Acoustics Speech and Signal Processing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Acoustics Speech and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W196919032","https://openalex.org/W1509016759","https://openalex.org/W1555540232","https://openalex.org/W1973977583","https://openalex.org/W1993691274","https://openalex.org/W1996465407","https://openalex.org/W2018843564","https://openalex.org/W2041253518","https://openalex.org/W2053515226","https://openalex.org/W2060108852","https://openalex.org/W2099111195","https://openalex.org/W2138026948","https://openalex.org/W2142090582","https://openalex.org/W2142508314","https://openalex.org/W2158894482","https://openalex.org/W2611071497","https://openalex.org/W2917583897","https://openalex.org/W4211131950","https://openalex.org/W4250116072"],"related_works":["https://openalex.org/W2056723920","https://openalex.org/W2076097444","https://openalex.org/W2160996252","https://openalex.org/W2765909687","https://openalex.org/W2142508314","https://openalex.org/W3021352102","https://openalex.org/W2166346116","https://openalex.org/W2951730657","https://openalex.org/W2016524125","https://openalex.org/W2011506041"],"abstract_inverted_index":{"Novel":[0],"maximal":[1,4,21,25,30,34,45,69,102,106,119,122,153,161],"coding":[2,6,120,124],"and":[3,23,121,146],"prefix":[5,26,35,46,103,123,154,162],"are":[7,19,125],"introduced.":[8],"We":[9],"show":[10],"that":[11,57,79,141],"for":[12,64,67,87,129,134],"finite":[13],"source":[14,54,76],"alphabets":[15],"all":[16],"Huffman":[17,41,62,85,95],"codes":[18,22,31,36,96,104],"optimal":[20,24,29,33,118],"codes.":[27,42,107],"Conversely,":[28],"or":[32,105],"need":[37],"not":[38,127],"to":[39,83],"be":[40],"For":[43],"any":[44,68],"code":[47,63,70,86,163],"C,":[48,71],"however,":[49],"there":[50,72],"exists":[51,73],"some":[52,74],"information":[53,75],"I":[55,77],"such":[56,78],"C":[58,80],"is":[59,81,115,139,164],"exactly":[60],"a":[61,84,109,147],"I.":[65,88],"And,":[66],"equivalent":[82],"In":[89],"other":[90],"words,":[91],"the":[92,99,152,156,160],"class":[93],"of":[94,101,112,158],"coincides":[97],"with":[98],"one":[100],"Additionally,":[108],"case":[110],"study":[111],"data":[113],"compression":[114],"investigated.":[116],"The":[117],"used":[126],"only":[128],"statistical":[130],"modeling":[131],"but":[132],"also":[133],"dictionary":[135],"methods.":[136],"Finally,":[137],"it":[138],"proven":[140],"given":[142],"an":[143],"original":[144],"file":[145,150],"corresponding":[148],"encoded":[149],"by":[151],"coding,":[155],"complexity":[157],"guessing":[159],"NP-complete.":[165]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}