{"id":"W2952828509","doi":"10.48550/arxiv.1808.03616","title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Decoding methods; Computer science; Error detection and correction; Sorting; Bit error rate; Code (set theory); Iterated function; Mathematics","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.0004751203,0.0003135474,0.0004360572,0.0004210876,0.0002048811,0.00009179362,0.001786525,0.0003278615,0.000005958323],"category_scores_gemma":[0.0001330716,0.0003857593,0.0002402957,0.0005290862,0.0001251803,0.0004167243,0.00146025,0.0003436484,0.000002744872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003533344,"about_ca_system_score_gemma":0.0003084711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008816131,"about_ca_topic_score_gemma":0.0002307564,"domain_scores_codex":[0.9980698,0.0001018154,0.0003165712,0.00104912,0.00009166167,0.0003710868],"domain_scores_gemma":[0.9970622,0.0003385441,0.000802984,0.001028785,0.000670205,0.00009726382],"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.0006238681,0.001406862,0.04490422,0.005805022,0.003124842,0.0004660201,0.01535117,0.1420765,0.06103803,0.2790683,0.005227096,0.4409081],"study_design_scores_gemma":[0.0002641875,0.0001135235,0.00009142167,0.0002329522,0.00005608825,0.000001766271,0.00005306791,0.9645297,0.0188148,0.01535662,0.00009133507,0.0003945236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05966268,0.0000626336,0.9378701,0.00002963439,0.0008880397,0.0005938258,0.00004399809,0.0004734131,0.0003756416],"genre_scores_gemma":[0.8307084,0.00004972187,0.1688061,0.00002595701,0.0001249187,0.000003302706,0.00001629423,0.00002414744,0.0002411688],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8224532,"threshold_uncertainty_score":0.9998595,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06003647075823058,"score_gpt":0.2260692522011064,"score_spread":0.1660327814428758,"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."}}