{"id":"W2156662959","doi":"10.1109/tvt.2011.2138176","title":"Bandwidth-Efficient Bit-Interleaved Coded Modulation Over NAF Relay Channels: Error Performance and Precoder Design","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Algorithm; Bandwidth (computing); Computer science; Upper and lower bounds; Cramér–Rao bound; Modulation (music); Bit error rate; Euclidean distance; Superposition principle; Channel (broadcasting); Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Decoding methods; Estimation theory; Artificial intelligence; Physics; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0002823584,0.0002039709,0.0001995483,0.0004647611,0.000397484,0.00004716363,0.000591848,0.0002218189,0.00005982955],"category_scores_gemma":[0.000007503165,0.0001933535,0.00005775687,0.000712079,0.0001482528,0.0002328818,0.00001854816,0.0004175657,0.00003897348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006733123,"about_ca_system_score_gemma":0.00003079263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003665121,"about_ca_topic_score_gemma":0.00001282329,"domain_scores_codex":[0.9986998,0.0001375956,0.0002746532,0.0004549464,0.0001507055,0.0002822412],"domain_scores_gemma":[0.9988603,0.00005295296,0.00008979554,0.0008095895,0.0001227278,0.0000646277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001733119,0.0009830224,0.0001723892,0.00004090571,0.0002093647,0.00001956521,0.005034227,0.3646568,0.02074803,0.008004723,0.0001951564,0.5997625],"study_design_scores_gemma":[0.0005009407,0.0002722754,0.0003955568,0.00006131463,0.00001367505,0.00003369856,0.00002521806,0.941094,0.05671885,0.0002433346,0.0004180297,0.0002230925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2294116,0.0001370553,0.7689251,0.000410538,0.0002966493,0.0003070788,8.989144e-7,0.0003909873,0.0001200826],"genre_scores_gemma":[0.9731023,0.0003368834,0.02610065,0.0001287943,0.000008670375,0.000121728,7.25401e-7,0.00001706815,0.0001832267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7436907,"threshold_uncertainty_score":0.7884727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0505269807513634,"score_gpt":0.2496155451767746,"score_spread":0.1990885644254112,"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."}}