{"id":"W2899538333","doi":"10.1109/tcomm.2018.2880204","title":"Throughput-Based Design for Polar-Coded Modulation","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Throughput; Algorithm; Decoding methods; Coding gain; Code rate; Quadrature amplitude modulation; Polar code; Automatic repeat request; Real-time computing; Bit error rate; Telecommunications link; Computer network; Telecommunications; Wireless","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.0008349331,0.0009642044,0.0004679557,0.0008765849,0.0005386794,0.001116308,0.0008626641,0.0004934429,0.002135511],"category_scores_gemma":[0.0035397,0.0003074997,0.0002517353,0.0007477703,0.0005493977,0.0007368136,0.0007818219,0.0007353773,0.001097793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001519586,"about_ca_system_score_gemma":0.001057555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009038278,"about_ca_topic_score_gemma":0.0009856209,"domain_scores_codex":[0.9989476,0.0002741443,0.00004400932,0.0001451518,0.0004982586,0.00009083722],"domain_scores_gemma":[0.9985379,0.0004940158,0.0001971708,0.0001496811,0.0005797356,0.00004158771],"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.0003832201,0.0001144482,0.001283669,0.0003010373,0.00006962829,0.0002645624,0.0002631738,0.5364017,0.1413221,0.1323692,0.004053778,0.1831734],"study_design_scores_gemma":[0.00002490706,0.0001733051,0.0003087215,0.00004315613,0.00003243373,0.0002314051,0.00002341659,0.9135702,0.05816409,0.0209192,0.006476449,0.00003275489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00772722,0.0002851995,0.9857287,0.0001016699,0.0000434205,0.00007595488,0.00007194282,0.0005215784,0.005444473],"genre_scores_gemma":[0.6879741,0.0008072866,0.3057592,0.0002004148,0.0001144091,0.000259427,0.0002248567,0.0001756825,0.004484599],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002135511,"threshold_uncertainty_score":0.01102543,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1228479749331736,"score_gpt":0.3495131739354024,"score_spread":0.2266651990022288,"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."}}