{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554847,0.0007010912,0.0004599116,0.0003192718,0.0002438821,0.0008561351,0.0005552087,0.0007333125,0.0007975986],"category_scores_gemma":[0.004472183,0.0002304786,0.0001730314,0.0003974415,0.0005610944,0.0009379257,0.0004556715,0.0005012534,0.000361584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006764544,"about_ca_system_score_gemma":0.0007577701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002190313,"about_ca_topic_score_gemma":0.002924626,"domain_scores_codex":[0.9989988,0.0002889508,0.00004204335,0.0001177523,0.0004589045,0.00009365215],"domain_scores_gemma":[0.9980768,0.001091396,0.0002560435,0.0001807221,0.0003706029,0.00002440793],"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.0004622839,0.00008077815,0.002692852,0.000368224,0.00009633293,0.0002669864,0.0003099339,0.7456623,0.0950091,0.04962534,0.0006436048,0.1047823],"study_design_scores_gemma":[0.00001092627,0.0001183372,0.000448033,0.00002857725,0.00002073952,0.0001754731,0.00002755062,0.96434,0.03031391,0.003660631,0.0008339921,0.00002184465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09157667,0.001103282,0.90249,0.0001744833,0.00002459015,0.00003713675,0.00007333489,0.0001836185,0.004336868],"genre_scores_gemma":[0.887219,0.00108781,0.109879,0.00006082066,0.00003583758,0.00004912002,0.00008686059,0.00002955706,0.001552068],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002190313,"threshold_uncertainty_score":0.005053103,"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."}}