{"id":"W2157877316","doi":"10.1109/tcomm.2010.03.080456","title":"Index assignment optimization for joint source-channel MAP decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Algorithm; List decoding; Simulated annealing; Hamming distance; Computer science; Sequential decoding; Assignment problem; Gaussian; Markov chain; Mathematical optimization; Mathematics; Statistics; Concatenated error correction code; Block code; Maximum likelihood","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.0004679026,0.0001681704,0.000144913,0.0002854419,0.000904776,0.0001585813,0.001698465,0.0001312664,0.00002086377],"category_scores_gemma":[0.00002954394,0.0001878425,0.0001389118,0.0003247242,0.0000842217,0.0002936789,0.00002448535,0.000557505,0.00001920222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008864058,"about_ca_system_score_gemma":0.00008163796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000042044,"about_ca_topic_score_gemma":0.0002746438,"domain_scores_codex":[0.9988251,0.00009120342,0.0003277007,0.0003187858,0.0001921697,0.0002450015],"domain_scores_gemma":[0.9966015,0.0003767513,0.000142322,0.002592014,0.0001896727,0.00009776586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003024767,0.001621635,0.00003632935,0.00004650021,0.0001277448,6.133718e-7,0.003272905,0.7252054,0.01558764,0.009669469,0.002780068,0.2416215],"study_design_scores_gemma":[0.0002252338,0.0000859162,0.00001150964,0.00002831344,0.00001348125,0.000008706063,0.00005799693,0.9787316,0.01591507,0.001521341,0.00318459,0.0002162673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001841466,0.00001588093,0.9931278,0.003769001,0.0009162599,0.0005783906,0.00000892308,0.0008517759,0.0005478773],"genre_scores_gemma":[0.589592,0.00002741143,0.4095321,0.0001502587,0.00001913382,0.0004176202,0.000003955166,0.00002029419,0.0002372372],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5894078,"threshold_uncertainty_score":0.7659996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04814961760117752,"score_gpt":0.2931908962022027,"score_spread":0.2450412786010251,"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."}}