{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002715221,0.000139269,0.0002174028,0.00009629494,0.0001583369,0.00005859114,0.000630939,0.00005688083,0.00009300264],"category_scores_gemma":[0.00001966314,0.0001132313,0.00009571065,0.0002285323,0.00002741535,0.0002899479,0.0004083936,0.00007775504,0.00003249348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002740132,"about_ca_system_score_gemma":0.00001638275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001697618,"about_ca_topic_score_gemma":0.000001525516,"domain_scores_codex":[0.9986978,0.0000320546,0.0002532641,0.0003830072,0.000294262,0.0003395969],"domain_scores_gemma":[0.9990151,0.00014748,0.0001083956,0.0005121675,0.0001218602,0.00009498275],"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.000007058567,0.0006049369,0.000008329078,0.0000298203,0.00004171811,0.00001486825,0.001358802,0.0003416057,0.0004463642,0.03720792,0.02055554,0.939383],"study_design_scores_gemma":[0.000610948,0.0001450521,0.00006443249,0.00004053509,0.00000597242,0.000006666932,0.0001145553,0.9899902,0.00598069,0.0002738087,0.002612435,0.0001547107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009117089,0.0001725565,0.9958221,0.00009325438,0.0003470331,0.0003205382,0.00008218137,0.0001088893,0.002141683],"genre_scores_gemma":[0.2968614,0.00002289021,0.7014518,0.0002576363,0.0001056138,0.00004782568,0.00001381644,0.00001657646,0.001222422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9896486,"threshold_uncertainty_score":0.4617437,"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."}}