{"id":"W1589106868","doi":"10.1109/dcc.1998.672310","title":"A memory-efficient adaptive Huffman coding algorithm for very large sets of symbols","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Huffman coding; Algorithm; Computer science; Shannon–Fano coding; Prefix code; Decoding methods; Canonical Huffman code; Coding (social sciences); Variable-length code; Theoretical computer science; Data compression; Mathematics; Block code; Code rate; Concatenated error correction code; Systematic code","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000628915,0.0006770584,0.0007505146,0.001173686,0.0007406807,0.0009251271,0.001773069,0.0009291866,0.00388011],"category_scores_gemma":[0.003592518,0.0003300202,0.0004968771,0.001861899,0.0007000076,0.001253087,0.001115727,0.001069561,0.00180903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001158965,"about_ca_system_score_gemma":0.001844795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008279265,"about_ca_topic_score_gemma":0.008899793,"domain_scores_codex":[0.999498,0.00008419537,0.00004955353,0.0001242747,0.0001844383,0.00005944592],"domain_scores_gemma":[0.9987161,0.0006146556,0.00009146221,0.0002097938,0.0003310238,0.00003699237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002184341,0.00005089668,0.0005578459,0.0001077794,0.00003071045,0.0001254873,0.0001641272,0.0540004,0.01907826,0.01703103,0.009270588,0.8993645],"study_design_scores_gemma":[0.00005186868,0.0000783311,0.0003526253,0.00003008148,0.00001997196,0.0001788706,0.00007557833,0.9498371,0.02359897,0.0173135,0.008440035,0.00002303815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01268177,0.0002992609,0.9827996,0.00017181,0.00006599896,0.00008579948,0.0001212085,0.00222294,0.001551523],"genre_scores_gemma":[0.05404971,0.0001300225,0.9422293,0.0001062287,0.00004661455,0.0001803845,0.0004263364,0.0001466628,0.00268473],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008279265,"threshold_uncertainty_score":0.01646215,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03235594851528556,"score_gpt":0.2578982604893415,"score_spread":0.2255423119740559,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}