{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085305,0.0006998902,0.0007637554,0.0003789622,0.0003768816,0.0007699417,0.0006251015,0.0007456925,0.001643487],"category_scores_gemma":[0.004556198,0.0002769025,0.0002291789,0.001019822,0.0006637046,0.001258838,0.00104698,0.0008206985,0.0004435158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006710044,"about_ca_system_score_gemma":0.001113835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001300638,"about_ca_topic_score_gemma":0.001254111,"domain_scores_codex":[0.9990766,0.0003728371,0.00004230937,0.0001545208,0.000258122,0.00009570456],"domain_scores_gemma":[0.9987664,0.0008125601,0.0001272556,0.0001153183,0.0001408852,0.00003757616],"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.000218823,0.00006832723,0.0003716179,0.0001080311,0.00003332615,0.00007555162,0.0001340162,0.8476857,0.01384885,0.04295344,0.001872267,0.09263007],"study_design_scores_gemma":[0.00001196924,0.00002858929,0.00007173145,0.000004336728,0.00000533842,0.0000290955,0.00001274679,0.9754706,0.005202606,0.01860846,0.0005473477,0.000007323246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01777651,0.0001480902,0.9796157,0.0001356235,0.00001912634,0.00002132619,0.00005207682,0.0002469413,0.001984601],"genre_scores_gemma":[0.5867391,0.0003507155,0.4077874,0.0001055001,0.00006184894,0.0001074111,0.000208147,0.0001663365,0.004473698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001643487,"threshold_uncertainty_score":0.005739748,"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."}}