{"id":"W2601496744","doi":"10.1109/tsp.2017.2740204","title":"Fast and Flexible Successive-Cancellation List Decoders for Polar Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Error detection and correction; Coding gain; Polar code; Throughput; Polar; Coding (social sciences); Bit error rate; Parity bit; Computer engineering; Telecommunications; Mathematics; Statistics; Physics; Wireless","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.0004949291,0.000621066,0.0004084187,0.0009062816,0.0005277422,0.0008416726,0.0009127342,0.000482515,0.002892085],"category_scores_gemma":[0.001754298,0.0002627361,0.0003003285,0.0008724549,0.0005208056,0.0008594172,0.0007818167,0.0008915111,0.001796643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007780271,"about_ca_system_score_gemma":0.001413765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00202546,"about_ca_topic_score_gemma":0.004290972,"domain_scores_codex":[0.9995158,0.00008839136,0.00003295889,0.00005277374,0.0002587695,0.00005123897],"domain_scores_gemma":[0.9991146,0.0003236859,0.0001212917,0.0001406689,0.0002694102,0.00003043026],"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.0007116024,0.0001162121,0.001228892,0.000436544,0.00006768818,0.0003900974,0.0003171315,0.1393384,0.2070347,0.0834044,0.01027098,0.5566834],"study_design_scores_gemma":[0.0001184411,0.0003363015,0.0005686368,0.00008118114,0.00004102302,0.0005972866,0.00004898869,0.7891734,0.1668032,0.01552709,0.02662535,0.00007904191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02104494,0.0005570962,0.9703537,0.0001692932,0.00007652899,0.0001187968,0.0001980093,0.002241467,0.005240099],"genre_scores_gemma":[0.2433504,0.0008289001,0.7464195,0.0002842068,0.0001180664,0.000218718,0.0007277728,0.0001711483,0.007881298],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002892085,"threshold_uncertainty_score":0.009674966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03388292182735758,"score_gpt":0.311307947499687,"score_spread":0.2774250256723294,"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."}}