{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999198,0.0006573093,0.000789346,0.0004442887,0.0003669269,0.000775697,0.0005684548,0.0006879105,0.001540773],"category_scores_gemma":[0.004027171,0.0002995018,0.000265618,0.000900926,0.0007411597,0.001167094,0.001070672,0.0007015023,0.0003954996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007921495,"about_ca_system_score_gemma":0.001221294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001094223,"about_ca_topic_score_gemma":0.001168184,"domain_scores_codex":[0.9991725,0.0003355202,0.00003876445,0.0001385843,0.0002322631,0.00008242956],"domain_scores_gemma":[0.9990507,0.0006140938,0.0001076146,0.00008775569,0.000108585,0.00003122125],"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.0001734585,0.00005332033,0.0003672337,0.00009076601,0.00003162715,0.0000671656,0.0001388702,0.8703697,0.01119922,0.04167712,0.001109605,0.0747219],"study_design_scores_gemma":[0.00001164465,0.0000287224,0.00008062704,0.000005047901,0.000006179877,0.00002979266,0.00001330072,0.9776151,0.004984569,0.01673486,0.000482665,0.00000746015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02232362,0.0001623481,0.9752151,0.0001174695,0.00001478892,0.00002266659,0.00004497316,0.0001771896,0.001921804],"genre_scores_gemma":[0.6301982,0.0002853861,0.3654245,0.00008013601,0.00003866833,0.00009823603,0.0001418108,0.0001219338,0.003611282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001540773,"threshold_uncertainty_score":0.005747437,"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."}}