{"id":"W2102278828","doi":"10.1109/isit.2006.261980","title":"On Optimal Index Assignment for MAP Decoding of Markov Sequences","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Computer science; Maximum a posteriori estimation; Markov chain; Assignment problem; Algorithm; Markov process; Mathematical optimization; Quadratic assignment problem; Index (typography); Metric (unit); Gaussian; Optimization problem; Mathematics; Statistics; Machine learning","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.001514959,0.0008506614,0.0008373468,0.0005991283,0.0003817575,0.0007120207,0.0006352933,0.0007878956,0.001786293],"category_scores_gemma":[0.007301095,0.0003731411,0.0003227136,0.00108305,0.001215298,0.001562041,0.00115389,0.0009026294,0.0004407262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008518513,"about_ca_system_score_gemma":0.001109118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001405546,"about_ca_topic_score_gemma":0.001215572,"domain_scores_codex":[0.9989436,0.0004935011,0.00004965525,0.0001231986,0.0003018669,0.00008816821],"domain_scores_gemma":[0.9977512,0.001810405,0.0001299457,0.00009745079,0.0001676825,0.000043207],"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.0001896457,0.00006487231,0.0002907331,0.000151423,0.00002567758,0.00009075641,0.0002124699,0.7862933,0.009213763,0.1096868,0.001609137,0.09217147],"study_design_scores_gemma":[0.00001299668,0.00004430752,0.00005214452,0.00001168139,0.000004371974,0.00003414676,0.00001901107,0.9680507,0.00275145,0.0284726,0.0005370388,0.000009629131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01071356,0.0002356092,0.9871932,0.000114599,0.00001761641,0.00002519634,0.0000242505,0.00006703446,0.001608863],"genre_scores_gemma":[0.5173187,0.001457913,0.4758329,0.0001942828,0.0001806692,0.0002097707,0.0001927895,0.0001528683,0.004460044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001786293,"threshold_uncertainty_score":0.008011937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01432894987952845,"score_gpt":0.2827932319919237,"score_spread":0.2684642821123953,"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."}}