{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000207879,0.0003090006,0.0003630311,0.0005420391,0.0005664654,0.0001614211,0.001118026,0.0002605282,0.00007444669],"category_scores_gemma":[0.00001642744,0.0002612647,0.0001430069,0.001181455,0.0002694268,0.0004115343,0.0000154768,0.0005088472,0.0002696373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009996442,"about_ca_system_score_gemma":0.00004393728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001759484,"about_ca_topic_score_gemma":0.00006358763,"domain_scores_codex":[0.9982758,0.0001133858,0.0003195869,0.0006121647,0.00019272,0.0004862968],"domain_scores_gemma":[0.9978541,0.0002166329,0.0001265009,0.001344433,0.0003595968,0.00009870098],"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.0001323512,0.001779047,0.00004300905,0.00005340896,0.0006587754,0.00004133291,0.001296954,0.07585225,0.5846564,0.03329635,0.001919968,0.3002701],"study_design_scores_gemma":[0.001904744,0.001139417,0.00001666546,0.0002049586,0.00006841397,0.0001365192,0.00009668851,0.6817783,0.3030504,0.0009815898,0.009891254,0.0007310922],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04035621,0.0003414514,0.9448259,0.01237341,0.0002325975,0.0007638955,0.000006074062,0.0008893911,0.0002109956],"genre_scores_gemma":[0.9389241,0.00019176,0.05831252,0.0003310574,0.00002555573,0.0005841127,0.000003748587,0.00003940656,0.001587731],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8985679,"threshold_uncertainty_score":0.999984,"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."}}