{"id":"W2532418359","doi":"10.1109/itw2.2006.323810","title":"Index Assignment Optimization for Joint Source-Channel MAP Decoding","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Computer science; List decoding; Channel (broadcasting); Index (typography); Joint (building); Algorithm; A priori and a posteriori; Sequential decoding; Quadratic programming; Mathematical optimization; Mathematics; Statistics; Telecommunications; Concatenated error correction code; Maximum likelihood; Engineering","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.0003380302,0.0001124916,0.0001040211,0.0001220676,0.0001279044,0.0001397598,0.0003430156,0.0000595909,0.00001257512],"category_scores_gemma":[0.00003338063,0.0001079058,0.00006124726,0.0001376649,0.0000111004,0.0001891387,0.000169289,0.00005749888,0.000006690551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009451087,"about_ca_system_score_gemma":0.00002530218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008640801,"about_ca_topic_score_gemma":0.00002377376,"domain_scores_codex":[0.9990362,0.00002293466,0.0002166274,0.0003104197,0.0001766645,0.0002371771],"domain_scores_gemma":[0.9994145,0.00005908661,0.00009420337,0.0003161994,0.00007919633,0.00003678209],"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.000009988275,0.0001771512,0.001296569,0.00004520026,0.00001562559,0.000002842012,0.0003762184,0.8781815,0.001677931,0.02823144,0.05162593,0.03835966],"study_design_scores_gemma":[0.0001374426,0.00005891011,0.0000683947,0.00001535935,0.000001835067,0.000004014428,0.00001770474,0.9796733,0.01299542,0.005819753,0.001056263,0.0001516222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003742558,0.00001608546,0.9948553,0.000679087,0.0003085278,0.0003162022,3.233776e-7,0.0009593413,0.002490907],"genre_scores_gemma":[0.43988,7.391717e-7,0.5585582,0.0001694935,0.00007478617,0.00005675125,0.000002476276,0.00001164059,0.001245988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4395057,"threshold_uncertainty_score":0.4400269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02180768099919016,"score_gpt":0.241966842041951,"score_spread":0.2201591610427608,"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."}}