{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002424968,0.0004692276,0.0009832414,0.001317335,0.0005891737,0.0007661588,0.0008105259,0.00116371,0.0008556014],"category_scores_gemma":[0.02188296,0.0003464324,0.0004006863,0.0007843755,0.001278989,0.001464381,0.001103376,0.0007107838,0.0002004037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008446175,"about_ca_system_score_gemma":0.001261012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008869687,"about_ca_topic_score_gemma":0.0006044714,"domain_scores_codex":[0.9982733,0.0006628946,0.00007341398,0.0001817114,0.0006364728,0.0001723082],"domain_scores_gemma":[0.9889184,0.007730091,0.001178657,0.0006728435,0.001285654,0.0002143093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009882945,0.00009470338,0.004119568,0.0003427013,0.0001201726,0.0005723119,0.0002947289,0.6913943,0.02997121,0.2043794,0.002633941,0.06508865],"study_design_scores_gemma":[0.00005743788,0.0001843713,0.001115846,0.00004056323,0.00001445574,0.0004678295,0.00005661134,0.9167676,0.008233336,0.07229965,0.000731717,0.00003057027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5368381,0.00137435,0.450879,0.0009074757,0.00004425799,0.00006031274,0.0002391994,0.0003314296,0.009325874],"genre_scores_gemma":[0.9177098,0.000378645,0.08046267,0.0001533498,0.00005128978,0.000065591,0.0002460152,0.00006684144,0.0008659454],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002424968,"threshold_uncertainty_score":0.01282459,"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."}}