{"id":"W2947190950","doi":"10.1109/access.2019.2919502","title":"Multiple-Block Combined Decoding for Cell Search With Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Block Error Rate; Decoding methods; Computer science; Algorithm; List decoding; Sequential decoding; Block (permutation group theory); Encoding (memory); Transmission (telecommunications); Theoretical computer science; Block code; Mathematics; Concatenated error correction code; Telecommunications","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.0004040179,0.0001736837,0.0002188167,0.0001568025,0.0001433954,0.0004078878,0.002075524,0.00007215878,0.000004603658],"category_scores_gemma":[0.00003326792,0.0001501431,0.00005832473,0.0003942018,0.0000264813,0.0008800217,0.0002809202,0.0001892333,0.00003455882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005954208,"about_ca_system_score_gemma":0.0000881345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002175444,"about_ca_topic_score_gemma":0.0001025525,"domain_scores_codex":[0.9985499,0.00005369854,0.0001852994,0.0004966395,0.000291303,0.000423112],"domain_scores_gemma":[0.9983135,0.0005464709,0.00009822789,0.0007455415,0.0002106737,0.00008557311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004351158,0.0005538063,0.8328499,0.0006277916,0.00008849515,0.00003860791,0.002626802,0.002393575,0.1346975,0.003288932,0.008683266,0.01371629],"study_design_scores_gemma":[0.00174334,0.0006673632,0.003178286,0.0001179462,0.00001079365,0.00001682828,0.0000433513,0.2361413,0.7563615,0.0005349076,0.0006747393,0.0005096827],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6059144,0.00001819403,0.3914525,0.0001717269,0.000390499,0.000645724,0.000003512186,0.0005407007,0.0008627523],"genre_scores_gemma":[0.9200808,0.000003042277,0.07921195,0.0002396323,0.00004521556,0.00005418991,0.000002047742,0.0000270536,0.0003360477],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8296716,"threshold_uncertainty_score":0.6122658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03400998204498339,"score_gpt":0.3090088241215295,"score_spread":0.2749988420765461,"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."}}