{"id":"W4400877879","doi":"10.1109/jsac.2024.3431579","title":"Decoding of Polar Codes Using Quadratic Unconstrained Binary Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Decoding methods; Binary number; Polar; Sequential decoding; List decoding; Algorithm; Binary code; Quadratic equation; Theoretical computer science; Concatenated error correction code; Block code; Arithmetic; Mathematics","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.0006217891,0.000671512,0.0005288062,0.00035234,0.0003013607,0.0008606411,0.0003845994,0.0006773553,0.002261919],"category_scores_gemma":[0.002091815,0.0003028469,0.0004042352,0.0005264706,0.0006545884,0.0007360234,0.0008448014,0.0009231024,0.0007122345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005059403,"about_ca_system_score_gemma":0.001189504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00179705,"about_ca_topic_score_gemma":0.002491686,"domain_scores_codex":[0.9995645,0.000153602,0.00002057236,0.00006463921,0.0001518633,0.00004489249],"domain_scores_gemma":[0.9993358,0.0003906893,0.00006556372,0.00005423039,0.0001345133,0.00001919521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001132821,0.00003433992,0.000507385,0.0001655746,0.00003474954,0.0001286029,0.00009168042,0.8391243,0.009632967,0.08779076,0.001782611,0.06059367],"study_design_scores_gemma":[0.00001081754,0.00002959438,0.00005481172,0.00001205389,0.000004167182,0.000036148,0.00001181594,0.9849012,0.003562982,0.01003497,0.001333855,0.000007533641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01419361,0.0002243405,0.9784744,0.0001840061,0.00003358403,0.00003322453,0.00006686335,0.0001586513,0.006631352],"genre_scores_gemma":[0.4074733,0.0008183198,0.5810956,0.0002916871,0.00006162495,0.0001571742,0.0004196111,0.0001903702,0.0094923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002261919,"threshold_uncertainty_score":0.00756681,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05457634294375869,"score_gpt":0.3419000424481128,"score_spread":0.2873236995043541,"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."}}