{"id":"W3122586336","doi":"10.1109/tcomm.2020.3030057","title":"Capacity-Approaching Polar Codes With Long Codewords and Successive Cancellation Decoding Based on Improved Gaussian Approximation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Additive white Gaussian noise; Decoding methods; Algorithm; Code word; Polar code; Code (set theory); Binary symmetric channel; Channel capacity; Polar; Gaussian; Mathematics; Binary number; List decoding; Channel (broadcasting); Low-density parity-check code; Concatenated error correction code; Computer science; Linear code; Telecommunications; Block code; Physics; Arithmetic","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.0007194644,0.0006059348,0.0004679651,0.0005412855,0.0003159823,0.0005667766,0.00055044,0.0006167041,0.0007712367],"category_scores_gemma":[0.002886459,0.0002400015,0.000485336,0.000737177,0.00103149,0.0007445744,0.0009147623,0.0009737256,0.0004040639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006639042,"about_ca_system_score_gemma":0.0009086867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00163659,"about_ca_topic_score_gemma":0.001182422,"domain_scores_codex":[0.9994161,0.0001889892,0.00001843146,0.00004467312,0.0002663214,0.00006550118],"domain_scores_gemma":[0.9990035,0.0005456342,0.0001058026,0.0001092329,0.0002001654,0.00003576229],"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.0001835087,0.00002795797,0.0006271653,0.00008749108,0.00003104952,0.0002244097,0.0002063601,0.696232,0.02340215,0.2464826,0.0006388846,0.03185652],"study_design_scores_gemma":[0.000009483849,0.00004374531,0.00006357856,0.000008924371,0.000006312348,0.0001001847,0.00001262008,0.9776502,0.007347555,0.01380008,0.0009435495,0.00001381869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04008904,0.0002735801,0.9541273,0.0001340262,0.00003630262,0.00002866643,0.00003731245,0.0001934369,0.005080396],"genre_scores_gemma":[0.5819472,0.0007011991,0.4127049,0.0001307671,0.00004124168,0.0001005945,0.000132738,0.00008251809,0.004158852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00163659,"threshold_uncertainty_score":0.004817009,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03976994118903215,"score_gpt":0.2659471788616559,"score_spread":0.2261772376726237,"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."}}