{"id":"W2168444669","doi":"10.1109/glocom.2010.5684175","title":"Optimal Precoder and Symbol Grouping for Bandwidth-Efficient Bit-Interleaved Coded Modulation over NAF Single-Relay Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Relay; Computer science; Coding gain; Algorithm; Diversity gain; Phase-shift keying; Upper and lower bounds; Bit error rate; Mathematics; MIMO; Telecommunications; Decoding methods; Fading; Power (physics); Channel (broadcasting)","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.0006146063,0.0004734121,0.0004214363,0.0001945067,0.0001883699,0.0003845853,0.0002979437,0.0003866354,0.0003742037],"category_scores_gemma":[0.001720305,0.0001933525,0.000176591,0.0003021654,0.0005552592,0.0003511504,0.0003007671,0.0002964253,0.0001306724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004065903,"about_ca_system_score_gemma":0.0006505052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001022908,"about_ca_topic_score_gemma":0.00141106,"domain_scores_codex":[0.999525,0.0002084997,0.00002008256,0.00005389574,0.0001348313,0.00005767783],"domain_scores_gemma":[0.9994838,0.0002580352,0.0001067142,0.0000564634,0.00007812768,0.0000166892],"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.0003009986,0.00006607024,0.001312818,0.0001492649,0.00004771809,0.0002153502,0.0002749385,0.8246544,0.04684513,0.05143459,0.0006357887,0.074063],"study_design_scores_gemma":[0.00002443543,0.0001194963,0.0002362168,0.00001264643,0.00001329866,0.0000776079,0.00002411565,0.984122,0.00680576,0.007897016,0.0006580586,0.000009274548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06864973,0.0001726239,0.929859,0.00006305255,0.000009081085,0.00002543033,0.00002955834,0.00003947395,0.001151893],"genre_scores_gemma":[0.8612688,0.0002522305,0.1376887,0.00003333463,0.00001987086,0.00006696388,0.0000432723,0.000008793505,0.0006179751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001022908,"threshold_uncertainty_score":0.00325042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03197275770847122,"score_gpt":0.270410317074861,"score_spread":0.2384375593663897,"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."}}