{"id":"W2158247330","doi":"10.1109/tit.2008.2008149","title":"A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Demodulation; Turbo code; Decoding methods; Algorithm; Electronic engineering; Code division multiple access; Redundancy (engineering); Channel (broadcasting); Telecommunications; 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.0007843438,0.0002114636,0.0002294441,0.000424001,0.0003346294,0.00008446148,0.0002323755,0.0001074646,0.00005448296],"category_scores_gemma":[0.00003555314,0.0002294743,0.0001485,0.000262148,0.00002583222,0.001704375,9.518757e-7,0.0002857653,0.00003221964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001539641,"about_ca_system_score_gemma":0.00001277575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002563218,"about_ca_topic_score_gemma":0.000001473214,"domain_scores_codex":[0.9988692,0.00009813989,0.0005382137,0.0001023181,0.0001535137,0.0002386563],"domain_scores_gemma":[0.9987634,0.0004865543,0.0001210352,0.0004160706,0.0001466521,0.00006627176],"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.00006922668,0.00001623063,1.293783e-7,0.00004490632,0.00002427331,4.350454e-8,0.0009165196,0.7841331,0.002366695,0.01989985,0.00003806157,0.1924909],"study_design_scores_gemma":[0.001710703,0.00007034594,0.000005497264,0.00007369767,0.00003082799,0.000005761464,0.000299988,0.8354825,0.1431369,0.01485909,0.003951834,0.0003728792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001308054,0.00003043058,0.9941328,0.00007899837,0.0004735309,0.0007454134,0.00006612895,0.001411879,0.001752719],"genre_scores_gemma":[0.777258,0.00006634906,0.222008,0.0002206833,0.00004311525,0.0002411771,0.00002172773,0.00002428067,0.0001166355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.77595,"threshold_uncertainty_score":0.9357693,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01663846040719789,"score_gpt":0.2937934868894657,"score_spread":0.2771550264822678,"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."}}