{"id":"W2004496619","doi":"10.1109/icc.2010.5502041","title":"Bandwidth-Efficient Bit-Interleaved Coded Modulation over NAF Relay Channels: Error Performance and Precoder Design","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Coding gain; Upper and lower bounds; Precoding; Algorithm; Phase-shift keying; Bandwidth (computing); Bit error rate; Expression (computer science); Modulation (music); Channel (broadcasting); Electronic engineering; Decoding methods; MIMO; Mathematics; Telecommunications; Engineering; Physics","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.0008324399,0.0005663219,0.0004225824,0.0002660012,0.0002497218,0.0006502824,0.0004572111,0.0005416906,0.0005484513],"category_scores_gemma":[0.003433206,0.0001959716,0.0001439658,0.0003692382,0.0004713206,0.0005923053,0.0004007266,0.0003651581,0.0002270196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005001327,"about_ca_system_score_gemma":0.0006732704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001508321,"about_ca_topic_score_gemma":0.002126887,"domain_scores_codex":[0.9993038,0.0002450323,0.00003586052,0.00007617687,0.0002737529,0.00006530422],"domain_scores_gemma":[0.9984123,0.0008966936,0.000220328,0.0001585148,0.0002911254,0.00002111568],"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.0005648195,0.00008608474,0.003007125,0.0003167604,0.00008454152,0.0002659238,0.0003423612,0.7310797,0.1007337,0.04143029,0.0006459631,0.1214428],"study_design_scores_gemma":[0.00001395799,0.0001297333,0.0003899079,0.00002101478,0.00001661347,0.0001753612,0.00002210835,0.9652888,0.02998278,0.003271948,0.0006694111,0.00001831018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1158106,0.0006805852,0.8803343,0.0001401374,0.00002031083,0.00003629965,0.00007413439,0.0001547901,0.002748945],"genre_scores_gemma":[0.9062442,0.0004748479,0.09236482,0.00003570895,0.00001767457,0.00004028558,0.00005551351,0.00001299539,0.0007538941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001508321,"threshold_uncertainty_score":0.004402399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04320525343694979,"score_gpt":0.2703127813700613,"score_spread":0.2271075279331115,"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."}}