{"id":"W3079579528","doi":"10.1109/tcomm.2020.3018184","title":"On the Complexity Reduction of Uplink Sparse Code Multiple Access for Spatial Modulation","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Decoding methods; Telecommunications link; Computational complexity theory; Reduction (mathematics); Bit error rate; Algorithm; Tree (set theory); Transmission (telecommunications); Code (set theory); Computer engineering; Theoretical computer science; Parallel computing; Mathematics; Computer network; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001843408,0.0003555819,0.0004210593,0.0002561146,0.00055735,0.0000681245,0.003192744,0.0003505133,0.00002769035],"category_scores_gemma":[0.00008837245,0.0003510532,0.0002703092,0.0003608301,0.0006199806,0.0001549706,0.00008760219,0.001612171,0.00001459058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002395008,"about_ca_system_score_gemma":0.00006229607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001193931,"about_ca_topic_score_gemma":0.000368901,"domain_scores_codex":[0.998391,0.00015175,0.0007009305,0.0003344402,0.0002144319,0.0002073973],"domain_scores_gemma":[0.9933691,0.00120529,0.0003242122,0.004798138,0.0002502901,0.00005295613],"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.00005630863,0.0002132296,0.000001849155,0.0001185303,0.0001501119,3.592558e-8,0.0002613599,0.9634971,0.002787609,0.00721341,0.0003554396,0.02534499],"study_design_scores_gemma":[0.0003329814,0.00005312065,0.0001107969,0.0001738328,0.00006172472,8.753719e-7,0.0001078137,0.904731,0.04610153,0.04743287,0.0005956563,0.0002977325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003842528,0.0001307051,0.9836018,0.007648562,0.000565508,0.001863014,0.0008755603,0.00114304,0.0003292639],"genre_scores_gemma":[0.9644474,0.001709479,0.0315036,0.00004043318,0.00002667827,0.00187688,0.0002889967,0.00008910694,0.00001736888],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9606049,"threshold_uncertainty_score":0.9998941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1990338196492995,"score_gpt":0.340194147862292,"score_spread":0.1411603282129925,"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."}}