{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008905795,0.0004343586,0.0003904731,0.0005055516,0.00107356,0.0003125388,0.005346541,0.0004831153,0.00001261214],"category_scores_gemma":[0.00005014554,0.0004993294,0.0003932228,0.0005337572,0.0002154487,0.0003280889,0.00007341788,0.001081595,0.00005024025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003872879,"about_ca_system_score_gemma":0.0005564601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002379333,"about_ca_topic_score_gemma":0.000265272,"domain_scores_codex":[0.9972788,0.000563051,0.0006197012,0.000812485,0.0003493263,0.0003766459],"domain_scores_gemma":[0.9894334,0.001456465,0.0004075423,0.0079353,0.0006600525,0.0001072527],"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.0002449887,0.004425401,0.00002106253,0.0004262359,0.0006682376,0.000002239296,0.005123225,0.7833437,0.005815646,0.01432216,0.01734979,0.1682573],"study_design_scores_gemma":[0.0003069383,0.0002235644,0.00002359331,0.0002263296,0.00007282689,0.000003054123,0.000010706,0.9430194,0.02853435,0.02567507,0.001406792,0.0004974079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009539393,0.00009067848,0.9893094,0.004109963,0.001390155,0.002059933,0.0001594373,0.002284727,0.0005003016],"genre_scores_gemma":[0.4616387,0.00005460218,0.5365854,0.0002386125,0.00003618173,0.001256774,0.00004065033,0.00004396198,0.0001051433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4615433,"threshold_uncertainty_score":0.9997458,"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."}}