{"id":"W2088327387","doi":"10.1109/tvt.2014.2331756","title":"Low-Complexity Full-Rate Transmission Scheme With Full Diversity for Two-Path Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"King Abdullah University of Science and Technology","keywords":"Relay; Decoding methods; Diversity gain; Transmission (telecommunications); Path (computing); Computer science; Block (permutation group theory); Full Rate; Cooperative diversity; Algorithm; Topology (electrical circuits); Mathematics; Telecommunications; Computer network; Fading","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007936172,0.0008178977,0.0008606189,0.00043859,0.000574393,0.0006631482,0.001362058,0.000642293,0.001942384],"category_scores_gemma":[0.001661938,0.0003738985,0.0004538197,0.0005560658,0.0006214174,0.001760827,0.001493848,0.0007640753,0.0005401938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004540479,"about_ca_system_score_gemma":0.0006104856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005029303,"about_ca_topic_score_gemma":0.0006645604,"domain_scores_codex":[0.9993906,0.0001984364,0.00004375747,0.00007456348,0.000212946,0.00007982073],"domain_scores_gemma":[0.9990847,0.0003434977,0.0001147304,0.0002325745,0.0001814527,0.00004298255],"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.0006610274,0.0002025693,0.0008230837,0.0008417415,0.0001652008,0.001024034,0.0008408076,0.3705812,0.2411993,0.1140298,0.004612,0.2650194],"study_design_scores_gemma":[0.00006825444,0.0003965585,0.0002783667,0.00003509546,0.0000399051,0.0007410122,0.00005107606,0.9608178,0.02111965,0.0135258,0.002840612,0.00008592629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05446153,0.0009309311,0.9396273,0.0002083024,0.0000620098,0.00009304859,0.00009870214,0.0004342961,0.004083839],"genre_scores_gemma":[0.8276592,0.0006575754,0.1687986,0.0001257175,0.00005135725,0.0001517652,0.0001102411,0.00002831814,0.002417041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001942384,"threshold_uncertainty_score":0.006497979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02326955982056844,"score_gpt":0.2460380666961091,"score_spread":0.2227685068755406,"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."}}