{"id":"W2911101083","doi":"10.1109/tit.2021.3132675","title":"A Deterministic Algorithm for the Capacity of Finite-State Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China; Research Grants Council, University Grants Committee; William and Flora Hewlett Foundation; National Science Foundation","keywords":"Mathematics; Algorithm; Polynomial; Mutual information; Channel (broadcasting); Finite state; Regular polygon; Exponential function; Channel capacity; Euclidean space; Mathematical optimization; Applied mathematics; Computer science; Markov chain; Combinatorics; Mathematical analysis; Statistics","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.001288638,0.001162038,0.0008211418,0.001292248,0.0007860317,0.001306217,0.002370784,0.001442487,0.006775147],"category_scores_gemma":[0.009159772,0.0005513986,0.0008790306,0.0009821319,0.001282845,0.001825817,0.001693864,0.002746959,0.001710048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001913667,"about_ca_system_score_gemma":0.002803497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004712586,"about_ca_topic_score_gemma":0.005278426,"domain_scores_codex":[0.9986054,0.0002958891,0.00007333441,0.0003341696,0.0005290764,0.0001621734],"domain_scores_gemma":[0.9964079,0.00211501,0.0001702611,0.000566016,0.0006454171,0.00009531084],"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.000312882,0.0001968454,0.0008420651,0.000199432,0.00009902927,0.0001444278,0.0001621459,0.499183,0.01027329,0.1702696,0.006964189,0.3113531],"study_design_scores_gemma":[0.00003005908,0.00001764874,0.00007047954,0.000008693409,0.000005392191,0.00002788909,0.000006082421,0.9720169,0.002538442,0.02419631,0.001067511,0.00001463442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002626166,0.00006044134,0.9949426,0.0001017137,0.00003581031,0.0000627719,0.00005704338,0.001088713,0.001024709],"genre_scores_gemma":[0.1459843,0.00009969564,0.8501648,0.0001261874,0.0000782185,0.000389163,0.0002972496,0.0003043645,0.002555936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006775147,"threshold_uncertainty_score":0.02266508,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02146117482327438,"score_gpt":0.2500111541727967,"score_spread":0.2285499793495224,"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."}}