{"id":"W1964227892","doi":"10.1109/tvt.2013.2259643","title":"Space–Time Trellis Codes for Two-Way Relay MIMO Channels With Single-Antenna Relay Nodes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Pairwise error probability; Relay; Relay channel; Trellis (graph); Upper and lower bounds; Space–time trellis code; MIMO; Topology (electrical circuits); Channel state information; Computer science; Space–time code; Diversity gain; Algorithm; Channel (broadcasting); Decoding methods; Mathematics; Telecommunications; Wireless; Block code; Power (physics); Concatenated error correction code; Physics; Combinatorics","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.001060106,0.0009596742,0.0005788035,0.0005925151,0.0004255074,0.001173431,0.0007019065,0.0009452763,0.001623271],"category_scores_gemma":[0.005353014,0.0003401246,0.00046649,0.001079303,0.0009205337,0.001027151,0.0005962046,0.0008763094,0.0005716434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324031,"about_ca_system_score_gemma":0.001577748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002316814,"about_ca_topic_score_gemma":0.002863905,"domain_scores_codex":[0.9985244,0.0004506648,0.0000832629,0.0002021079,0.0005521333,0.0001876587],"domain_scores_gemma":[0.99546,0.002312978,0.0007841577,0.0003876435,0.0009682807,0.00008692529],"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.000235081,0.0000502878,0.0008991368,0.0004045082,0.00008802189,0.0003447207,0.0002505242,0.7745574,0.03288591,0.1288483,0.001499248,0.05993694],"study_design_scores_gemma":[0.00002173876,0.0001675708,0.0001888148,0.00004929434,0.00001976802,0.0002415018,0.00003591446,0.9666252,0.01310001,0.01680214,0.002712913,0.00003522706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03330029,0.001558096,0.9584543,0.0002685791,0.00007763782,0.00009619245,0.0002064171,0.0001698856,0.00586861],"genre_scores_gemma":[0.8185593,0.002052349,0.1743584,0.0001694028,0.0001330619,0.0002596572,0.0003178742,0.00006505033,0.004084878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002316814,"threshold_uncertainty_score":0.00960654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01985202980741413,"score_gpt":0.2380201801751442,"score_spread":0.2181681503677301,"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."}}