{"id":"W2295334956","doi":"10.1109/lcomm.2015.2513775","title":"BER Upper Bound Expressions in Coded Two-Transmission Schemes With Arbitrarily Spaced Signal Constellations","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Economic Development and Innovation","keywords":"Fading; Transmission (telecommunications); Upper and lower bounds; Algorithm; Trellis (graph); Computer science; Mathematics; Nakagami distribution; Convolutional code; Expression (computer science); Signal-to-noise ratio (imaging); Trellis modulation; Decoding methods; Constellation diagram; Topology (electrical circuits); Bit error rate; Telecommunications; Combinatorics; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0004717726,0.0002329063,0.0002453368,0.000292342,0.0005679677,0.0002713358,0.002612599,0.00006548961,0.0000304567],"category_scores_gemma":[0.00002988546,0.0002094196,0.00006423916,0.001057471,0.0003824492,0.0007613078,0.0004722223,0.0005787368,0.00004854389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001425994,"about_ca_system_score_gemma":0.0002790454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004179425,"about_ca_topic_score_gemma":0.0002159216,"domain_scores_codex":[0.9979538,0.0006108792,0.0004141243,0.0003583897,0.0003232718,0.0003395054],"domain_scores_gemma":[0.9959411,0.0004652525,0.0001448299,0.002983477,0.0002303496,0.0002350102],"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.0002480309,0.002415698,0.03046786,0.00004436445,0.0003527871,0.00005210242,0.03742141,0.04171836,0.5080003,0.2452356,0.05669079,0.07735264],"study_design_scores_gemma":[0.01060655,0.0002326214,0.005299551,0.001302527,0.00008325431,0.0001291451,0.00117843,0.5709162,0.02090007,0.002371211,0.3845405,0.002439989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1107107,0.00199977,0.8063885,0.06605078,0.0001650973,0.0007767127,0.000006124731,0.0003972185,0.01350508],"genre_scores_gemma":[0.8530111,0.000292552,0.1438692,0.0025473,0.00002491165,0.00008976057,0.00002611878,0.00001945297,0.0001195418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7423005,"threshold_uncertainty_score":0.8539885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0645962669066422,"score_gpt":0.3041738088914973,"score_spread":0.239577541984855,"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."}}