{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003729415,0.0005090386,0.000342926,0.0005827936,0.0003306986,0.0008347442,0.0004998234,0.0003139464,0.001650118],"category_scores_gemma":[0.00235415,0.0001583968,0.0002788098,0.0005554331,0.0004727465,0.0007333935,0.0006491316,0.0005947922,0.0007785952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003690066,"about_ca_system_score_gemma":0.001492811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001960253,"about_ca_topic_score_gemma":0.00316055,"domain_scores_codex":[0.9994851,0.00009949505,0.00002515398,0.00003649935,0.0002844345,0.00006928726],"domain_scores_gemma":[0.9988354,0.0004646287,0.0001253108,0.0002016754,0.0003486397,0.00002439106],"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.000748792,0.00008630309,0.002562354,0.0003363044,0.00005854285,0.0003515639,0.0002896425,0.1457897,0.1782998,0.1049441,0.003104254,0.5634288],"study_design_scores_gemma":[0.00004504659,0.0001916134,0.0004539204,0.00004126397,0.00002612896,0.0003439617,0.00006215819,0.7764465,0.2013053,0.01426291,0.006788943,0.00003220649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06203507,0.0002664113,0.932,0.0001097628,0.00004018579,0.00003428407,0.00005702278,0.001108994,0.004348322],"genre_scores_gemma":[0.5304856,0.0004062005,0.4631532,0.0001008804,0.00004640327,0.00006595554,0.0002499172,0.0001576121,0.005334282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001960253,"threshold_uncertainty_score":0.005520225,"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."}}