{"id":"W1518463267","doi":"10.1109/pacrim.2001.953552","title":"Reduced code transmission and high speed reconstruction of Huffman tables","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Huffman coding; Canonical Huffman code; Prefix code; Computer science; Tunstall coding; Shannon–Fano coding; Table (database); Code (set theory); Algorithm; Parallel computing; Coding (social sciences); Data compression; Decoding methods; Block code; Mathematics; Code rate; Concatenated error correction code; Programming language; Statistics; Data mining; Systematic code","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"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.0003169608,0.0003000786,0.000427412,0.0005075606,0.000289477,0.0005790063,0.000580869,0.0005484314,0.001686708],"category_scores_gemma":[0.002021292,0.0002404516,0.0003247453,0.000722014,0.0004483464,0.0008349327,0.000523568,0.0007420357,0.0006447302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003316907,"about_ca_system_score_gemma":0.0003702457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007201871,"about_ca_topic_score_gemma":0.0005360426,"domain_scores_codex":[0.9995291,0.00008848649,0.00001748772,0.00005336823,0.0002680238,0.00004351786],"domain_scores_gemma":[0.9994081,0.0002567851,0.00005291374,0.0001491584,0.0001185746,0.00001452682],"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.0005450778,0.0000737494,0.0006932845,0.0003394682,0.00006597552,0.0009568165,0.0004261571,0.1439299,0.1594742,0.3392172,0.005953861,0.3483244],"study_design_scores_gemma":[0.00005132205,0.0001615457,0.0004183925,0.00004347072,0.00003648327,0.001462114,0.00004483994,0.7385318,0.194872,0.04518394,0.01914351,0.00005057854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04459528,0.0009306145,0.9459574,0.0001709594,0.0001032676,0.00004650584,0.00009675867,0.0007543875,0.007344853],"genre_scores_gemma":[0.4984361,0.001209494,0.4898124,0.0001277333,0.0001299243,0.00009512941,0.0004242706,0.0001585621,0.009606415],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001686708,"threshold_uncertainty_score":0.005642653,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02135958668999454,"score_gpt":0.2234542486223997,"score_spread":0.2020946619324051,"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."}}