{"id":"W2055286490","doi":"10.1587/transfun.e94.a.2092","title":"Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources","year":2011,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Huffman coding; Universal code; Prefix code; Monotone polygon; Redundancy (engineering); Canonical Huffman code; Constant-weight code; Mathematics; Shannon–Fano coding; Source code; Code (set theory); Polynomial code; Code word; Systematic code; Algorithm; Coding (social sciences); Discrete mathematics; Computer science; Statistics; Code rate; Linear code; Decoding methods","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.0005095561,0.0001509966,0.0002144383,0.00008169996,0.0009618742,0.0001248668,0.002651549,0.00005082794,0.00001054779],"category_scores_gemma":[0.000003264524,0.0001141275,0.0001253387,0.0004324591,0.0008250573,0.0004914166,0.0002038856,0.0001712459,7.707972e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002702772,"about_ca_system_score_gemma":0.0001598235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002075115,"about_ca_topic_score_gemma":0.0001266445,"domain_scores_codex":[0.9985925,0.0001310705,0.0004069049,0.0003450456,0.0002557308,0.0002687641],"domain_scores_gemma":[0.9978619,0.000264825,0.0002866616,0.001419121,0.0001063615,0.00006113802],"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.0002087033,0.006258046,0.001914815,0.0002251716,0.000577076,7.151203e-7,0.01959892,0.01003439,0.005772056,0.3269616,0.0005285391,0.6279199],"study_design_scores_gemma":[0.0007172805,0.001746797,0.002760025,0.0001410819,0.00005389768,0.00001733507,0.0001284244,0.9532101,0.01915731,0.008133351,0.0135933,0.0003411597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07615018,0.001401834,0.920642,0.0008162177,0.0001152336,0.0004064137,0.00006936509,0.0000372676,0.0003614613],"genre_scores_gemma":[0.7775182,0.0008227276,0.2214234,0.0001531561,0.000005081411,0.00003766546,0.000002948623,0.000005286617,0.00003153652],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9431757,"threshold_uncertainty_score":0.7398056,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05801735668246414,"score_gpt":0.2914103260384139,"score_spread":0.2333929693559498,"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."}}