{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055984,0.001395456,0.0008218799,0.001511895,0.0005092545,0.002048886,0.001275112,0.001399255,0.003542123],"category_scores_gemma":[0.01381281,0.0004241117,0.0005774639,0.001487597,0.001686699,0.002575031,0.00161594,0.001931148,0.001410263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002983636,"about_ca_system_score_gemma":0.000798854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001439014,"about_ca_topic_score_gemma":0.001625863,"domain_scores_codex":[0.9977967,0.0006036799,0.00009975433,0.0001821079,0.001009071,0.0003087354],"domain_scores_gemma":[0.9908426,0.006335779,0.000503618,0.0008862017,0.001350745,0.0000810249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001511377,0.00006904631,0.0006223052,0.0006008203,0.000055093,0.0003744447,0.0003449069,0.6585475,0.01142109,0.2660616,0.00420132,0.05755071],"study_design_scores_gemma":[0.000007069632,0.00004363509,0.0004076124,0.0001679238,0.00002713351,0.0002332983,0.00005031437,0.9161083,0.005585235,0.0726067,0.004729931,0.0000328546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01965398,0.005668369,0.941736,0.0006050809,0.0001674874,0.00003938526,0.0001959694,0.0004387574,0.03149491],"genre_scores_gemma":[0.7266166,0.007768765,0.2446806,0.0006721274,0.000340473,0.0002805091,0.0004223508,0.0004840355,0.01873453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003542123,"threshold_uncertainty_score":0.02164787,"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."}}