{"id":"W2945448702","doi":"10.1109/tit.2019.2917683","title":"Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Upper and lower bounds; Algorithm; Energy (signal processing); Encoder; Encoding (memory); Polar code; Block (permutation group theory); Topology (electrical circuits); Discrete mathematics; Mathematics; Combinatorics; Artificial intelligence; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.0006597946,0.00009823756,0.0001013686,0.0001950906,0.0002306024,0.0001093169,0.0002060218,0.00004494329,0.00004094927],"category_scores_gemma":[0.00001503361,0.00007735199,0.0000392972,0.000165546,0.0001246894,0.0009872009,0.000007758566,0.0001879771,0.00002698173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003351084,"about_ca_system_score_gemma":0.00002642258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009318821,"about_ca_topic_score_gemma":0.000001727994,"domain_scores_codex":[0.9992598,0.00008763812,0.0002348653,0.0001072467,0.0002038388,0.0001065864],"domain_scores_gemma":[0.998944,0.0005965714,0.0001201073,0.0002307348,0.00007712848,0.00003142737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000814853,0.00006068807,0.000197755,0.00005677404,0.00003668329,2.331985e-7,0.006972053,0.006272058,0.0004324122,0.9261138,0.0000855575,0.05969047],"study_design_scores_gemma":[0.001075596,0.0008349748,0.004314929,0.0003467536,0.00002574162,0.00009033373,0.001722792,0.6318847,0.03383137,0.3245075,0.0007252676,0.0006400897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.15885,0.000005713656,0.8366866,0.0003275744,0.0002720519,0.0001745275,0.00000784854,0.0001184416,0.003557278],"genre_scores_gemma":[0.9895702,0.000006605935,0.009770475,0.0006050265,0.000004502813,0.000008372254,9.5736e-7,0.000003948947,0.00002991565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8307202,"threshold_uncertainty_score":0.3154323,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01782478463574644,"score_gpt":0.2435174787233424,"score_spread":0.225692694087596,"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."}}