{"id":"W2132001419","doi":"10.1109/ccece.2006.277598","title":"Group-Optimal Linear Space-Time Multiuser Detection","year":2006,"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":"Multiuser detection; Computer science; Computational complexity theory; Exploit; Reduction (mathematics); Algorithm; Dimension (graph theory); Detector; Code division multiple access; Group (periodic table); Performance improvement; Time complexity; Mathematical optimization; Mathematics; 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.0006441738,0.0003928241,0.0007877253,0.0002923766,0.0002765718,0.0005411405,0.0005069468,0.0006964049,0.001359279],"category_scores_gemma":[0.001946323,0.0002003257,0.0003172274,0.0004396951,0.000654255,0.0007571151,0.0007996293,0.0004107033,0.0007584484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002420045,"about_ca_system_score_gemma":0.0005462403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003598829,"about_ca_topic_score_gemma":0.0006573334,"domain_scores_codex":[0.9992343,0.0002531376,0.00003002672,0.0001128279,0.000277305,0.00009241475],"domain_scores_gemma":[0.9994255,0.0002331285,0.00008662851,0.0001035494,0.0001277132,0.00002343298],"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.0007949127,0.0001881632,0.00233172,0.0002953751,0.000232698,0.0003260045,0.0003566153,0.4369137,0.06383564,0.08421525,0.004234869,0.406275],"study_design_scores_gemma":[0.00004685333,0.0002049786,0.0003891443,0.00000870212,0.0000295106,0.0002055886,0.00002642852,0.9566562,0.0177238,0.02199176,0.002695109,0.00002202154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0195662,0.0002811287,0.9777471,0.0001367957,0.00003251334,0.00002046621,0.00002666819,0.0003011805,0.001887956],"genre_scores_gemma":[0.6101856,0.000285085,0.3854987,0.0002164504,0.00009606899,0.0000479966,0.00009205085,0.000032589,0.003545423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001359279,"threshold_uncertainty_score":0.004547238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01129466241784928,"score_gpt":0.2474033415032131,"score_spread":0.2361086790853638,"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."}}