{"id":"W2034776565","doi":"10.1049/iet-com.2013.0421","title":"Lower bound on the bit error rate of a decode‐and‐forward relay network under chaos shift keying communication system","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Relay; Bit error rate; Computer science; CHAOS (operating system); Keying; Bit (key); Telecommunications; Computer network; Decoding methods; Physics; Computer security","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002730401,0.0002201766,0.0003020811,0.0001029358,0.001725707,0.0002588877,0.004917081,0.00009789553,0.00001397894],"category_scores_gemma":[0.0001968417,0.0001757798,0.0001078614,0.0007777819,0.0004111243,0.0003108676,0.002353659,0.0005717598,0.00005828134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009154173,"about_ca_system_score_gemma":0.00007155907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004541545,"about_ca_topic_score_gemma":0.0004300784,"domain_scores_codex":[0.9964017,0.002224306,0.0005859357,0.0002914232,0.0001978548,0.0002987364],"domain_scores_gemma":[0.988537,0.003232917,0.0004007758,0.007487243,0.0002445468,0.00009751567],"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.000007975548,0.00007813203,0.000174556,0.00001164418,0.00004573582,8.491581e-8,0.001609548,0.002064739,0.00007804303,0.9905218,0.001343811,0.004063878],"study_design_scores_gemma":[0.0008820592,0.0002156184,0.01412128,0.001083438,0.00007012429,0.00001288993,0.0006414339,0.8784637,0.0001756615,0.01892751,0.08474367,0.0006626327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07912028,0.01054461,0.6899907,0.1579154,0.0007417023,0.002202212,0.00001466587,0.001006786,0.05846361],"genre_scores_gemma":[0.9821371,0.001985523,0.01376693,0.001758296,0.00003600841,0.0001491872,0.00001575331,0.000022633,0.0001286085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9715943,"threshold_uncertainty_score":0.9995739,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05583631251590348,"score_gpt":0.2912714703264103,"score_spread":0.2354351578105068,"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."}}