{"id":"W2143036872","doi":"10.1109/vetecs.2003.1207807","title":"Upper bounds on the access code efficiency for CDMA using signals with an interference free window","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Interference (communication); Code division multiple access; Computer science; Window (computing); Code (set theory); Dimension (graph theory); Upper and lower bounds; Algorithm; Telecommunications; Electronic engineering; Mathematics; Engineering; Channel (broadcasting)","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":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006886656,0.0001531412,0.0001394412,0.0001097406,0.0005180725,0.001101591,0.007069924,0.00005038152,0.00003358693],"category_scores_gemma":[0.00008374879,0.00008902836,0.00004324374,0.0006492597,0.0001926488,0.0009018967,0.001043446,0.0002501995,0.0000100781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053059,"about_ca_system_score_gemma":0.0002867983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001367551,"about_ca_topic_score_gemma":0.0002903228,"domain_scores_codex":[0.9983697,0.0001512027,0.0002009917,0.0004055946,0.0004516492,0.0004208687],"domain_scores_gemma":[0.9967282,0.000541159,0.00008197009,0.002290511,0.0002510122,0.0001071874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002178429,0.0008817551,0.001051473,0.00002803829,0.00006245318,0.000006774895,0.002687619,0.2578683,0.004789662,0.7076827,0.0008675141,0.02385585],"study_design_scores_gemma":[0.001111851,0.0009665319,0.001103666,0.0001952015,0.000005105684,0.00001402325,0.0001465812,0.952621,0.02003714,0.02310188,0.000343123,0.0003539298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1731651,0.00002979955,0.8198668,0.004588885,0.00004608227,0.0004632393,0.000002582177,0.0001053604,0.001732144],"genre_scores_gemma":[0.957353,0.000007727677,0.04157152,0.000847769,0.0000415439,0.00006889448,0.000001620868,0.00001466452,0.00009323597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.784188,"threshold_uncertainty_score":0.9999354,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1196788163746024,"score_gpt":0.366723929811848,"score_spread":0.2470451134372457,"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."}}