{"id":"W2071495366","doi":"10.1109/jphot.2013.2255033","title":"Chip-Asynchronous Binary Optical CDMA: An Optimum Signaling Scheme for Random Delays","year":2013,"lang":"en","type":"article","venue":"IEEE photonics journal","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Asynchronous communication; Computer science; Chip; Code division multiple access; Electronic engineering; Robustness (evolution); Channel capacity; Binary number; Channel (broadcasting); Computer network; Telecommunications; Engineering; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008045438,0.000290376,0.0003970476,0.0001548607,0.0003219218,0.0002790331,0.000372727,0.0001929984,0.0002460852],"category_scores_gemma":[0.00002633992,0.0002645743,0.0002743454,0.0001351225,0.00005367681,0.0005411604,0.00001520792,0.0005994085,0.00009592541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001004568,"about_ca_system_score_gemma":0.00005833911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004418063,"about_ca_topic_score_gemma":0.000001840068,"domain_scores_codex":[0.9982879,0.00006932737,0.0005573683,0.0002146234,0.000234757,0.0006359815],"domain_scores_gemma":[0.9989199,0.0001550632,0.00009195619,0.0002779346,0.0001463678,0.000408795],"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.0002576077,0.0001863508,0.00008609264,0.0001679743,0.0004010396,0.00007438596,0.0008081947,0.2676021,0.7250877,0.001307191,0.002003534,0.002017794],"study_design_scores_gemma":[0.004886453,0.0005183132,0.00004843449,0.000160139,0.00009085683,0.001234239,0.0004013007,0.9012887,0.08278364,0.006174203,0.001690914,0.0007227528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9332877,0.0009875795,0.06205738,0.00002830553,0.00191617,0.0005195169,0.000009388906,0.0001805859,0.001013377],"genre_scores_gemma":[0.9827163,0.00008036476,0.01639563,0.00005364891,0.0005096318,0.0001158595,0.000006180585,0.00008855249,0.00003379187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6423041,"threshold_uncertainty_score":0.9999806,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01171122969851612,"score_gpt":0.220870009376781,"score_spread":0.2091587796782649,"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."}}