{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003054999,0.0002359025,0.0002129062,0.0002237168,0.0009965125,0.0002517668,0.001026928,0.0001000322,0.00000404622],"category_scores_gemma":[0.00003333997,0.0002297,0.00005768756,0.0007137429,0.0001396461,0.0006180656,0.00001477266,0.0007004779,0.000004066221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001490962,"about_ca_system_score_gemma":0.0001077602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002809526,"about_ca_topic_score_gemma":0.0009912493,"domain_scores_codex":[0.9984589,0.0003017704,0.0002981116,0.0004549231,0.0002545669,0.0002317781],"domain_scores_gemma":[0.9975376,0.000584136,0.0002141002,0.001384348,0.0001289775,0.0001508392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007716137,0.002920349,0.004444648,0.0007437695,0.000512162,0.00001622546,0.05441297,0.3270346,0.03818674,0.04327975,0.0002134426,0.5274637],"study_design_scores_gemma":[0.0003786306,0.0002629677,0.0002725829,0.0001375021,0.0000313602,0.00000584483,0.00009934281,0.9830301,0.0152595,0.0002043609,0.00005055479,0.0002672566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004856681,0.00003449895,0.9846553,0.007983615,0.00006975032,0.0005551098,0.00002093147,0.0007179648,0.001106114],"genre_scores_gemma":[0.785013,0.00002830175,0.214276,0.0004987924,0.00001250279,0.0001287877,0.000008999861,0.00002314334,0.00001045176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7801563,"threshold_uncertainty_score":0.9366894,"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."}}