{"id":"W2608866305","doi":"10.1109/glocom.2017.8254146","title":"Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Mathematics; Polynomial ring; Polynomial expansion; Algorithm; Applied mathematics; Interval (graph theory); Polynomial; Polar; Discrete mathematics; Computer science; Combinatorics; Mathematical analysis","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.001594474,0.0006041517,0.0005241867,0.001202448,0.0007356461,0.001232923,0.0010497,0.000753266,0.002308973],"category_scores_gemma":[0.007255287,0.0004597268,0.0007551461,0.0007576589,0.002977991,0.002587261,0.001766421,0.00225749,0.0005987438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008383169,"about_ca_system_score_gemma":0.0006939222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005127455,"about_ca_topic_score_gemma":0.0003712684,"domain_scores_codex":[0.9989139,0.0003551474,0.0000438351,0.000187704,0.0003674828,0.0001319754],"domain_scores_gemma":[0.9970531,0.001797945,0.0002226856,0.0004748429,0.0003314723,0.0001198663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002449208,0.00001206645,0.0002854995,0.00003515164,0.000005180388,0.0000571552,0.0001613226,0.0333779,0.003947011,0.9496031,0.0002805128,0.01221058],"study_design_scores_gemma":[0.00002062123,0.0000930391,0.0001667222,0.00004139656,0.00001023289,0.0002359659,0.00006818834,0.4390209,0.008411773,0.5467793,0.005114887,0.00003717844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01571638,0.0001469196,0.9804524,0.00008617445,0.00002178902,0.00002424169,0.00002010755,0.00008284717,0.003449185],"genre_scores_gemma":[0.4837651,0.0007439391,0.5084963,0.0002331032,0.0001604591,0.0002695282,0.0001426654,0.0002502363,0.005938642],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002308973,"threshold_uncertainty_score":0.008432448,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02362302383466364,"score_gpt":0.3103734069780927,"score_spread":0.2867503831434291,"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."}}