{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006146632,0.001053962,0.0005717024,0.0006773482,0.0004166192,0.0005927625,0.000758892,0.0007860097,0.002923291],"category_scores_gemma":[0.001688737,0.0003220166,0.0005314387,0.0004947697,0.0009124333,0.000829751,0.0008740966,0.001053675,0.00174376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004869405,"about_ca_system_score_gemma":0.0009637517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000583778,"about_ca_topic_score_gemma":0.0009543629,"domain_scores_codex":[0.9993243,0.0001878805,0.00003842273,0.0001025376,0.0002931463,0.00005364639],"domain_scores_gemma":[0.9993929,0.0002611425,0.00005771137,0.0001373113,0.0001317972,0.00001929181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002198312,0.0002134329,0.0003512986,0.0003353669,0.00007484331,0.0002736043,0.0003545151,0.1315695,0.1312063,0.2799709,0.004156253,0.4512742],"study_design_scores_gemma":[0.00005883857,0.000277341,0.0001856509,0.00003968559,0.00003072915,0.000852419,0.00001924574,0.8592175,0.09739939,0.03087287,0.01096152,0.00008484963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002748821,0.0001040792,0.9949095,0.00005232493,0.00002452556,0.0000331777,0.00001688508,0.0001959624,0.001914751],"genre_scores_gemma":[0.1234682,0.000336074,0.868561,0.000143737,0.00008670248,0.000192966,0.00008268042,0.00007840241,0.007050186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002923291,"threshold_uncertainty_score":0.009779334,"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."}}