{"id":"W2023370966","doi":"10.1109/qbsc.2012.6221380","title":"A capacity-complexity trade-off for CDMA with multi-user demodulation","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Code division multiple access; Decoding methods; Demodulation; Interference (communication); Throughput; Computational complexity theory; Reduction (mathematics); Channel capacity; Chip; Channel (broadcasting); Multiuser detection; Electronic engineering; Computer network; Telecommunications; Wireless; Algorithm; Engineering; Mathematics","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.00178854,0.0006637919,0.0006394001,0.000861457,0.0006077181,0.001441028,0.0006588151,0.0009985551,0.001763105],"category_scores_gemma":[0.01259187,0.0003885372,0.0003841011,0.0008342703,0.001083051,0.002252132,0.001102014,0.0008338987,0.000279818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001381468,"about_ca_system_score_gemma":0.0009280723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001537828,"about_ca_topic_score_gemma":0.002336744,"domain_scores_codex":[0.9984622,0.0004971576,0.00005556123,0.0001039663,0.0005964629,0.0002846286],"domain_scores_gemma":[0.9914646,0.006952534,0.0003758942,0.0005975203,0.0005073352,0.00010233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005284551,0.0001288568,0.001950548,0.000207232,0.00005788817,0.0004377973,0.000152987,0.843658,0.04419442,0.07397203,0.00058659,0.03412524],"study_design_scores_gemma":[0.00002965662,0.0001705243,0.0007937604,0.00003187657,0.00002635625,0.0002893784,0.00004286336,0.9544362,0.02723318,0.01621492,0.0006844914,0.00004678921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4095798,0.002520439,0.5664385,0.0009700443,0.00006197729,0.0001003787,0.0001585437,0.0003728394,0.01979745],"genre_scores_gemma":[0.9770318,0.0003136742,0.02176607,0.0000654031,0.0000225308,0.00003598036,0.00002705089,0.0000339592,0.0007036442],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00178854,"threshold_uncertainty_score":0.01002336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.132372313715079,"score_gpt":0.3253838910545733,"score_spread":0.1930115773394943,"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."}}