{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005042564,0.0001192476,0.00007685216,0.0001112777,0.0004292698,0.0003434432,0.0005100857,0.00006214092,0.00009752656],"category_scores_gemma":[0.000004488647,0.00007814544,0.00007475473,0.0002383496,0.00004975592,0.006474007,0.000006151158,0.0002023667,0.0004194688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003162809,"about_ca_system_score_gemma":0.00002402687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003691634,"about_ca_topic_score_gemma":3.775885e-7,"domain_scores_codex":[0.9991328,0.00007416573,0.0001758487,0.00008717167,0.0002872145,0.0002428658],"domain_scores_gemma":[0.999073,0.0001289634,0.00009233678,0.0005548321,0.00006565654,0.00008515912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005941191,0.0001359805,0.000005338848,0.00001975535,0.00004471568,3.035988e-7,0.01085434,0.001989093,0.00009125021,0.1332791,0.007327706,0.846193],"study_design_scores_gemma":[0.001550964,0.0003295477,0.0006373705,0.00007947433,0.0000622928,0.0001147278,0.002535528,0.3348568,0.06316046,0.01147265,0.5842099,0.0009902942],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000475831,0.0000353394,0.9943851,0.001438271,0.001087016,0.0001568433,0.0000512098,0.0001545521,0.002215792],"genre_scores_gemma":[0.9865906,0.00002355631,0.009836692,0.002425428,0.00008318837,0.00005453131,0.000007275597,0.000006388766,0.0009723154],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9861148,"threshold_uncertainty_score":0.5391563,"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."}}