{"id":"https://openalex.org/W2165607283","doi":"https://doi.org/10.1109/dcc.2002.1000024","title":"Less redundant codes for variable size dictionaries","display_name":"Less redundant codes for variable size dictionaries","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2165607283","doi":"https://doi.org/10.1109/dcc.2002.1000024","mag":"2165607283"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2002.1000024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2002.1000024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings DCC 2002. Data Compression Conference","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/A5100512711","display_name":"Zhen Yao","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Zhen Yao","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069179055","display_name":"Nasir Rajpoot","orcid":"https://orcid.org/0000-0002-4706-1308"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"N. Rajpoot","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100512711"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":1.4039,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.85998394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"481","last_page":"481"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.989799976348877,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/code-word","display_name":"Code word","score":0.8413372039794922},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.621726393699646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5206822156906128},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.5176647305488586},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.49252042174339294},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4884399473667145},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.46810317039489746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4587019681930542},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44122201204299927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4125516414642334},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.3697596788406372},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.356711208820343},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.32147207856178284},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.31932365894317627}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.8413372039794922},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.621726393699646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5206822156906128},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.5176647305488586},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.49252042174339294},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4884399473667145},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.46810317039489746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4587019681930542},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44122201204299927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4125516414642334},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.3697596788406372},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.356711208820343},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.32147207856178284},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31932365894317627},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/dcc.2002.1000024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2002.1000024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings DCC 2002. Data Compression Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:61223","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.5178","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.5178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.warwick.ac.uk/~csvhe/lrc.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.4796","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.4796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.warwick.ac.uk/~nasir/papers/dcc02_summary.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1547966682","https://openalex.org/W1990653637","https://openalex.org/W2047304795","https://openalex.org/W2061310268","https://openalex.org/W2097530618","https://openalex.org/W2107189042","https://openalex.org/W2107745473","https://openalex.org/W2114700786","https://openalex.org/W2122962290","https://openalex.org/W2127836646","https://openalex.org/W2166127198","https://openalex.org/W2611071497"],"related_works":["https://openalex.org/W2497702133","https://openalex.org/W2975172758","https://openalex.org/W4250402636","https://openalex.org/W2082705204","https://openalex.org/W2964219554","https://openalex.org/W1631960500","https://openalex.org/W2363582660","https://openalex.org/W2369287763","https://openalex.org/W2772956856","https://openalex.org/W2506713089"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"We":[4,51,210],"report":[5],"on":[6,216],"a":[7,80,133,197,204,226],"family":[8,36],"of":[9,22,31,54,108,200,207,254],"variable-length":[10],"codes":[11,32,166],"with":[12,156,194,196,258],"less":[13],"redundancy":[14,182],"than":[15],"the":[16,23,48,58,61,66,71,74,87,97,114,136,140,150,159,180,217,221,236,242],"flat":[17,184],"code":[18,63,68,76,99,115,188,257],"used":[19],"in":[20,131,183,192,220,246],"most":[21],"variable":[24],"size":[25],"dictionary-based":[26],"compression":[27],"methods.":[28],"The":[29,92,125,162,186],"length":[30],"belonging":[33],"to":[34,158,173,179,233],"this":[35],"is":[37,77,106,129,154,176,189,244,260],"still":[38],"bounded":[39],"above":[40],"by":[41,79],"[log/sub":[42],"2/":[43],"|D|]":[44],"where":[45],"|D|":[46],"denotes":[47],"dictionary":[49,223],"size.":[50],"describe":[52],"three":[53],"these":[55],"codes,":[56],"namely,":[57],"balanced":[59,75,82,165],"code,":[60],"phase-in-binary":[62],"(PB),":[64],"and":[65,112,144,164,224],"depth-span":[67],"(DS).":[69],"As":[70],"name":[72],"implies,":[73],"constructed":[78],"height":[81],"tree,":[83],"so":[84],"it":[85,105,146,148],"has":[86,100],"shortest":[88],"average":[89],"codeword":[90,143,218],"length.":[91,152],"corresponding":[93],"coding":[94,127],"tree":[95,128],"for":[96,262],"PB":[98,163,256],"an":[101,251],"interesting":[102],"property":[103],"that":[104,135,241],"made":[107],"full":[109],"binary":[110,122],"phases,":[111],"thus":[113],"can":[116],"be":[117],"computed":[118],"efficiently":[119],"using":[120],"simple":[121],"shifting":[123,231],"operations.":[124],"DS":[126,187],"maintained":[130],"such":[132,202],"way":[134],"coder":[137],"always":[138],"finds":[139],"longest":[141],"extendable":[142],"extends":[145],"until":[147],"reaches":[149],"maximum":[151],"It":[153],"optimal":[155],"respect":[157],"code-length":[160],"contrast.":[161],"have":[167],"almost":[168],"similar":[169],"improvements,":[170],"around":[171],"3%":[172],"7%":[174],"which":[175],"very":[177],"close":[178],"relative":[181],"code.":[185],"particularly":[190],"good":[191],"dealing":[193],"files":[195],"large":[198],"amount":[199],"redundancy,":[201],"as":[203],"running":[205],"sequence":[206],"one":[208],"symbol.":[209],"also":[211],"did":[212],"some":[213],"empirical":[214],"study":[215],"distribution":[219],"LZW":[222],"proposed":[225],"scheme":[227],"called":[228],"dynamic":[229],"block":[230],"(DBS)":[232],"further":[234],"improve":[235],"codes'":[237],"performance.":[238],"Experiments":[239],"suggest":[240],"DBS":[243,259],"helpful":[245],"compressing":[247],"random":[248],"sequences.":[249],"From":[250],"application":[252],"point":[253],"view,":[255],"recommended":[261],"general":[263],"practical":[264],"usage.":[265]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}