{"id":"W2044804826","doi":"10.1109/tit.2012.2216975","title":"How Suboptimal Is the Shannon Code?","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Isfahan University of Technology","keywords":"Huffman coding; Prefix code; Canonical Huffman code; Redundancy (engineering); Mathematics; Shannon–Fano coding; Variable-length code; Information theory; Code (set theory); Algorithm; Code word; Discrete mathematics; Computer science; Code rate; Data compression; Set (abstract data type); Statistics; Linear code; Block code; Decoding methods; 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.006573987,0.0005337862,0.001548445,0.001770137,0.001381641,0.003182695,0.0009962906,0.002705467,0.001495763],"category_scores_gemma":[0.04641561,0.0003945231,0.0004496385,0.001908756,0.003903405,0.003941809,0.00111152,0.000851173,0.000800031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002283848,"about_ca_system_score_gemma":0.003509662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003872546,"about_ca_topic_score_gemma":0.003905784,"domain_scores_codex":[0.9923929,0.002878143,0.0003635646,0.0009191561,0.002878106,0.0005681269],"domain_scores_gemma":[0.977969,0.01309952,0.00192603,0.002470987,0.003981717,0.0005526438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001156596,0.0001334506,0.03007099,0.0006565818,0.0005878353,0.0005931836,0.0009432595,0.3269623,0.01833387,0.3996324,0.01513413,0.2057953],"study_design_scores_gemma":[0.00008665723,0.0004096512,0.007950795,0.0002876965,0.0001395133,0.002365773,0.001069195,0.5156211,0.02019032,0.4396288,0.01197891,0.0002717185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4354411,0.009475715,0.5045261,0.01164814,0.0006304064,0.0001163341,0.0010675,0.0009688414,0.0361258],"genre_scores_gemma":[0.9178588,0.002304252,0.07552627,0.001000274,0.0002796225,0.00007349335,0.0003959651,0.0002422369,0.002318965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006573987,"threshold_uncertainty_score":0.03476697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01405111346375145,"score_gpt":0.2270726498354226,"score_spread":0.2130215363716712,"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."}}