{"id":"W3104359459","doi":"","title":"1Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Precoding; Relay; MIMO; Zero-forcing precoding; Fading; Topology (electrical circuits); Mathematics; Mutual information; Relay channel; Singular value; Channel capacity; Channel state information; Computer science; Eigenvalues and eigenvectors; Channel (broadcasting); Mathematical optimization; Telecommunications; Statistics; Wireless; Power (physics); Combinatorics; Physics","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.001572444,0.0008613089,0.0007006377,0.0009260067,0.0005070642,0.001227228,0.0007759605,0.0007450837,0.002238457],"category_scores_gemma":[0.01111613,0.0004902596,0.0003270922,0.001015618,0.002125815,0.001628287,0.001015157,0.0008293083,0.0004855317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002019269,"about_ca_system_score_gemma":0.00124774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002255787,"about_ca_topic_score_gemma":0.001580528,"domain_scores_codex":[0.9989915,0.0003938695,0.00003170913,0.0001025773,0.0003252175,0.0001551421],"domain_scores_gemma":[0.9938993,0.004154358,0.0005450865,0.0002830221,0.0009796004,0.0001385327],"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.00006267711,0.00002993777,0.0005063388,0.0001053051,0.0000224107,0.0001900318,0.0001093404,0.7208928,0.003064707,0.2658723,0.001509396,0.007634653],"study_design_scores_gemma":[0.000007208596,0.00002256771,0.000263897,0.0000256667,0.000004907863,0.00007537096,0.00003262665,0.889361,0.0007116895,0.1091219,0.0003549124,0.00001810928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.139388,0.002702289,0.819144,0.001424834,0.0001158433,0.00007591377,0.0005091275,0.0004132317,0.03622681],"genre_scores_gemma":[0.9803976,0.0010079,0.01554957,0.00008031035,0.00009843537,0.0001114848,0.0001796147,0.00005626036,0.002518948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002255787,"threshold_uncertainty_score":0.01465088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06467812725319336,"score_gpt":0.2797865075468076,"score_spread":0.2151083802936143,"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."}}