{"id":"https://openalex.org/W1810652084","doi":"https://doi.org/10.1109/dcc.2003.1194030","title":"Hybrid prefix codes for practical use","display_name":"Hybrid prefix codes for practical use","publication_year":2003,"publication_date":"2003-11-04","ids":{"openalex":"https://openalex.org/W1810652084","doi":"https://doi.org/10.1109/dcc.2003.1194030","mag":"1810652084"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2003.1194030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2003.1194030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2003. Proceedings. DCC 2003","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/A5041451971","display_name":"Mike Liddell","orcid":null},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"M. Liddell","raw_affiliation_strings":["Department of Computer Science and Software Engineering, University of Melbourne, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, University of Melbourne, VIC, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081861848","display_name":"Alistair Moffat","orcid":"https://orcid.org/0000-0002-6638-0232"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A. Moffat","raw_affiliation_strings":["Department of Computer Science and Software Engineering, University of Melbourne, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, University of Melbourne, VIC, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041451971"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.9137,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79478962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"392","last_page":"401"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9994000196456909,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9282000064849854,"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/prefix-code","display_name":"Prefix code","score":0.9405653476715088},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.7554277181625366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7065452337265015},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6336356401443481},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5890920162200928},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5357133150100708},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5304103493690491},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4878835678100586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.465084969997406},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4424673318862915},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.38344401121139526},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37299397587776184}],"concepts":[{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.9405653476715088},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.7554277181625366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7065452337265015},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6336356401443481},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5890920162200928},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5357133150100708},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5304103493690491},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4878835678100586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.465084969997406},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4424673318862915},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.38344401121139526},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37299397587776184},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.2003.1194030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2003.1194030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2003. Proceedings. DCC 2003","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.6600000262260437,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2056723920","https://openalex.org/W4237802754","https://openalex.org/W2011506041","https://openalex.org/W2166346116","https://openalex.org/W2016524125","https://openalex.org/W2142508314","https://openalex.org/W2094225155","https://openalex.org/W1650274465","https://openalex.org/W2031881996","https://openalex.org/W1996227932"],"abstract_inverted_index":{"Prefix-free":[0],"codes":[1,32,39,125,146],"continue":[2],"to":[3,11,65],"enjoy":[4],"widespread":[5],"use":[6],"in":[7],"compression":[8,51,98],"systems":[9],"due":[10],"their":[12,16,50,134],"simple":[13,43,87],"structure":[14,44,88],"and":[15,93,115,149],"ease":[17],"of":[18,89,96,100,107,122,143],"decoding.":[19],"Minimum-redundancy":[20],"prefix":[21,38,60,80],"codes,":[22,26],"such":[23],"as":[24,56,128,130],"Huffman":[25],"are":[27,126],"widely":[28],"used.":[29],"However,":[30],"approximate":[31],"also":[33],"receive":[34],"considerable":[35],"attention.":[36],"Flat":[37],"have":[40],"an":[41],"extremely":[42],"that":[45,84],"facilitates":[46],"fast":[47,113,117],"decoding,":[48],"but":[49],"effectiveness":[52,99],"is":[53,62,76,82,147],"often":[54],"regarded":[55],"poor.":[57],"The":[58,104],"minimum-redundancy":[59,102,144],"code":[61,70,81,92,110],"much":[63,95],"slower":[64],"decode":[66],"than":[67],"a":[68,90,101],"flat":[69,91],"while":[71],"the":[72,86,97,108,123,131,140],"compressed":[73,118],"file":[74],"size":[75],"minimized.":[77],"A":[78],"hybrid":[79,109,124],"presented":[83,148],"exhibits":[85],"retains":[94],"code.":[103],"structural":[105],"constraints":[106],"should":[111],"enable":[112],"decoding":[114],"provide":[116],"string":[119],"searching.":[120],"Properties":[121],"discussed":[127],"well":[129],"method":[132],"for":[133,139],"efficient":[135,141],"calculation.":[136],"An":[137],"algorithm":[138],"construction":[142],"K-flat":[145],"tested":[150],"empirically.":[151]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}