{"id":"W2150125601","doi":"10.1109/lcomm.2005.1461671","title":"Bonferroni-type bounds for CDMA systems with nonuniform signalling","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Bonferroni correction; Code division multiple access; Upper and lower bounds; Signal-to-noise ratio (imaging); Bit error rate; Mathematics; Multiuser detection; Signalling; Spread spectrum; Computer science; Detector; Topology (electrical circuits); Algorithm; Computer network; Statistics; Telecommunications; Combinatorics; Decoding methods","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.01330649,0.003172012,0.001657352,0.002958817,0.001688611,0.002501338,0.003039856,0.00183418,0.007652842],"category_scores_gemma":[0.06622481,0.001098116,0.00117668,0.002056694,0.004002711,0.006285573,0.004675519,0.004035716,0.002162883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003996406,"about_ca_system_score_gemma":0.002133597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001299077,"about_ca_topic_score_gemma":0.001826722,"domain_scores_codex":[0.9904951,0.00357897,0.0005252183,0.001050748,0.003089995,0.001260068],"domain_scores_gemma":[0.9542417,0.03216664,0.003539696,0.003725321,0.00551195,0.0008147012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005140321,0.0000639499,0.002554044,0.0006361072,0.0001332293,0.0003810048,0.0004614566,0.1567236,0.008853716,0.7398087,0.00555366,0.08431656],"study_design_scores_gemma":[0.00005824747,0.0003806611,0.001904323,0.0003839008,0.00009108731,0.0007304915,0.0001036996,0.406142,0.01537186,0.5616209,0.0129731,0.0002397072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01727033,0.005305276,0.957996,0.0009519582,0.0003218402,0.00008862328,0.0003491787,0.0003353631,0.01738127],"genre_scores_gemma":[0.6529416,0.008865577,0.3227436,0.001705685,0.001075011,0.000672445,0.0007988461,0.0003152952,0.01088194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01330649,"threshold_uncertainty_score":0.07037222,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0586626524623277,"score_gpt":0.3083369425704199,"score_spread":0.2496742901080922,"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."}}