{"id":"W2115835796","doi":"10.1109/4234.917103","title":"Optical CDMA using 2-D codes: the optimal single-user detector","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Detector; Code division multiple access; Computer science; Bit error rate; Code (set theory); Upper and lower bounds; Dimension (graph theory); Code rate; Algorithm; Channel (broadcasting); Electronic engineering; Mathematics; Telecommunications; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002389447,0.0001497389,0.0001390154,0.00007366286,0.0003296683,0.00008786056,0.001050792,0.0000626723,0.00002290704],"category_scores_gemma":[0.00001733049,0.0001260296,0.00009208981,0.0002996305,0.0002534659,0.0001359039,0.00006989874,0.0003012365,0.00007500363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007596496,"about_ca_system_score_gemma":0.000006642002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001438327,"about_ca_topic_score_gemma":0.0000254633,"domain_scores_codex":[0.9991104,0.0001467007,0.0002493006,0.0001111189,0.0001191003,0.0002633666],"domain_scores_gemma":[0.9979408,0.0002694628,0.0000334052,0.001669439,0.000027258,0.00005960223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001674041,0.00009536755,0.0005815409,0.00002494936,0.0001890141,0.00001086618,0.001254238,0.1188738,0.8695231,0.003480237,0.003314937,0.002635185],"study_design_scores_gemma":[0.001878371,0.0001174525,0.00273273,0.0004432459,0.0004224341,0.0009259885,0.002771084,0.4847188,0.06826665,0.0004161212,0.4350109,0.002296282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9572506,0.0004508442,0.03766007,0.001703747,0.0003871937,0.0001964753,0.000005580766,0.0003048023,0.002040688],"genre_scores_gemma":[0.9944531,0.00005185811,0.004746281,0.0005375301,0.00009760439,0.00004013271,0.000005043055,0.00003807708,0.00003035247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8012565,"threshold_uncertainty_score":0.5139338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03879768961472976,"score_gpt":0.2460603157315882,"score_spread":0.2072626261168584,"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."}}