{"id":"W2111068473","doi":"10.4108/icst.broadnets2009.7271","title":"A Simple Near-Capacity Concatenation Scheme Over MISO Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Concatenation (mathematics); Simple (philosophy); Fading; Computer science; Telecommunications link; Scheme (mathematics); Algorithm; Channel (broadcasting); Convolutional code; Channel capacity; Wireless; Decoding methods; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Arithmetic; Combinatorics","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.0009297765,0.001248268,0.000999655,0.0005192487,0.001165573,0.001124378,0.0008382713,0.0008226901,0.002062236],"category_scores_gemma":[0.001917331,0.0003761268,0.0003683083,0.0006494134,0.001045026,0.002089337,0.002459715,0.001175558,0.00085151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004697246,"about_ca_system_score_gemma":0.0006160526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000280654,"about_ca_topic_score_gemma":0.0005392815,"domain_scores_codex":[0.9990121,0.0002837267,0.0000818046,0.0001676657,0.0002918395,0.0001627349],"domain_scores_gemma":[0.9984499,0.0004522279,0.0002286673,0.0004874401,0.000241975,0.000139708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002058689,0.0002824104,0.002386746,0.0005200286,0.0002339644,0.001172495,0.0007518545,0.1801967,0.2032752,0.2247034,0.004973586,0.3794449],"study_design_scores_gemma":[0.0001022333,0.001309985,0.001086197,0.0001146173,0.000251963,0.001526442,0.0001389846,0.7547647,0.1599865,0.04650952,0.03392697,0.0002818501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09984028,0.0016351,0.8842599,0.0004368489,0.0003452778,0.0001804072,0.0001842905,0.001531068,0.01158683],"genre_scores_gemma":[0.8261193,0.0005407702,0.1657616,0.0002124712,0.0002810544,0.0001220501,0.0001676962,0.00005790123,0.006737195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002062236,"threshold_uncertainty_score":0.00689888,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01995428449816012,"score_gpt":0.2617925796550479,"score_spread":0.2418382951568878,"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."}}