{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204971,0.0009390846,0.0006798769,0.0009684777,0.0007204335,0.002846023,0.001433694,0.001099726,0.008882741],"category_scores_gemma":[0.01096449,0.0003880245,0.0008020118,0.0013879,0.002104312,0.004115564,0.001614781,0.002074221,0.00117579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002579046,"about_ca_system_score_gemma":0.00189089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002654763,"about_ca_topic_score_gemma":0.003710952,"domain_scores_codex":[0.9981264,0.0003328516,0.00007994557,0.0002415345,0.0007242832,0.0004949669],"domain_scores_gemma":[0.9913446,0.006967805,0.0002893263,0.0008529479,0.0004356336,0.0001097367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005927265,0.000133714,0.001214279,0.0004036732,0.00005826039,0.0002518565,0.0002289996,0.4618064,0.02089746,0.4166002,0.006132354,0.09168009],"study_design_scores_gemma":[0.000026942,0.00009422049,0.0005572431,0.00005651814,0.00002930859,0.0002036153,0.00006650783,0.8564978,0.01283736,0.1262212,0.003373516,0.00003573629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2002461,0.003449636,0.703967,0.002911442,0.0002210139,0.0001933886,0.0007928568,0.00129885,0.08691958],"genre_scores_gemma":[0.8751761,0.002882182,0.1041568,0.0004763759,0.0002583895,0.0004471439,0.001013401,0.0004059569,0.01518353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008882741,"threshold_uncertainty_score":0.02971572,"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."}}