{"id":"W2801011149","doi":"10.1109/iscas.2018.8351832","title":"Low-Complexity Software Stack Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Computational complexity theory; Sorting; Sequential decoding; Error detection and correction; List decoding; Code (set theory); Concatenated error correction code; Computer engineering; Theoretical computer science; Block code","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":[],"consensus_categories":[],"category_scores_codex":[0.0003695829,0.0001137288,0.0001689457,0.0001082932,0.0001112462,0.0000557284,0.001017042,0.00005217981,0.00008089094],"category_scores_gemma":[0.0001902322,0.0001036902,0.00005647543,0.0003444552,0.0001623296,0.0003516249,0.0004326717,0.00009455632,0.00005296121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003798996,"about_ca_system_score_gemma":0.00005319526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002891003,"about_ca_topic_score_gemma":0.0003195808,"domain_scores_codex":[0.9989467,0.00005117866,0.0002314151,0.0002997247,0.0002260621,0.0002449774],"domain_scores_gemma":[0.9987614,0.0001295743,0.0001096851,0.0006935164,0.0002445416,0.00006125968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000509996,0.0006838925,0.1418111,0.0003641676,0.00008965449,0.00002533476,0.01032753,0.00001019463,0.08424219,0.4510098,0.0381666,0.2732185],"study_design_scores_gemma":[0.0002061426,0.0004310019,0.007597288,0.0001185306,0.000005557188,0.00002316272,0.00009014091,0.0187301,0.9251486,0.04618639,0.001018482,0.0004446115],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1287873,0.00001394378,0.8649473,0.00009925084,0.0002254898,0.00008644153,0.000002328927,0.001082336,0.004755671],"genre_scores_gemma":[0.5484042,0.000001175658,0.4513176,0.000128278,0.00003199424,0.000001587166,4.202544e-7,0.000005564583,0.0001091536],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8409064,"threshold_uncertainty_score":0.4228362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04428452878262642,"score_gpt":0.3025277288897651,"score_spread":0.2582432001071387,"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."}}