{"id":"W4388427910","doi":"10.1109/blackseacom58138.2023.10299751","title":"Decoding of Polar Codes with Finite Memory","year":2023,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Decoding methods; Algorithm; Computer science; Sequence (biology); Sequential decoding; Tree (set theory); Binary number; List decoding; Stack (abstract data type); Mathematics; Arithmetic; Block code; Concatenated error correction 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.0003336253,0.00007157461,0.000108999,0.0001730763,0.00004751319,0.00002977414,0.0005328519,0.00002681827,0.00001025174],"category_scores_gemma":[0.00007924698,0.0000559974,0.00002661047,0.0007660389,0.00002812107,0.0002062009,0.0002052084,0.00006999504,0.00003841367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001214056,"about_ca_system_score_gemma":0.00003593287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00010457,"about_ca_topic_score_gemma":0.00007297643,"domain_scores_codex":[0.9993163,0.00002744576,0.000122122,0.0001894507,0.0001793734,0.0001653447],"domain_scores_gemma":[0.9991885,0.00025615,0.00005681148,0.0004026564,0.00006312079,0.00003269614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007190015,0.0003042807,0.1672188,0.0004324411,0.0002307668,0.0004291019,0.01883217,0.004020734,0.1064036,0.2965973,0.04877897,0.3566799],"study_design_scores_gemma":[0.0004297162,0.0005644514,0.0103757,0.0002258382,0.00001170731,0.00004867656,0.0005436253,0.4103463,0.565609,0.009885644,0.001313964,0.0006453473],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147288,0.00001804453,0.8623096,0.0003711072,0.0001205648,0.00009851636,9.106132e-7,0.002463344,0.01988918],"genre_scores_gemma":[0.8244134,0.000005368843,0.1746793,0.00009049346,0.000009538448,0.000004970643,5.798304e-7,0.000007035642,0.0007893228],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7096846,"threshold_uncertainty_score":0.2283508,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02417529029229274,"score_gpt":0.2675262801294531,"score_spread":0.2433509898371603,"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."}}