{"id":"W2798867000","doi":"10.1109/glocom.2018.8648105","title":"Generalized Fast Decoding of Polar Codes","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; List decoding; Sequential decoding; Computer science; Algorithm; Polar code; Berlekamp–Welch algorithm; Polar; Code (set theory); Coding (social sciences); Concatenated error correction code; Mathematics; Set (abstract data type); Block code; Statistics","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.000499811,0.0009293677,0.0006494329,0.0007969452,0.0005249718,0.001077091,0.0006158069,0.0006204119,0.002260206],"category_scores_gemma":[0.002364931,0.0002362225,0.0004472551,0.001045076,0.0008286372,0.001098434,0.001538126,0.001014811,0.001740202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005052268,"about_ca_system_score_gemma":0.001358992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001218594,"about_ca_topic_score_gemma":0.001491168,"domain_scores_codex":[0.9992803,0.0001815975,0.00004135694,0.000115203,0.0002741859,0.0001073496],"domain_scores_gemma":[0.9984598,0.0004903527,0.0001093907,0.0004163098,0.000480713,0.00004340945],"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.0005997866,0.00005741958,0.001151892,0.0004652887,0.00004955313,0.0006427202,0.0005910647,0.2254247,0.1428903,0.2167095,0.005294648,0.406123],"study_design_scores_gemma":[0.00007131119,0.0002526206,0.0003846248,0.00009090672,0.00002591316,0.0008680429,0.000141687,0.7468434,0.1349252,0.0935717,0.02276998,0.00005446552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02123313,0.000392092,0.971704,0.0001403046,0.00007745295,0.00005089002,0.0001382295,0.0005629153,0.005701013],"genre_scores_gemma":[0.3271332,0.001302552,0.6619731,0.0002773456,0.0001352586,0.0001799419,0.0007185196,0.0002227126,0.008057474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002260206,"threshold_uncertainty_score":0.007561147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03681981122579413,"score_gpt":0.3066811974545411,"score_spread":0.269861386228747,"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."}}