{"id":"W4285407559","doi":"10.1109/cwit55308.2022.9817664","title":"Single-Minimum LDPC Decoding Offset Optimization Methods","year":2022,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Heuristics; Computational complexity theory; Node (physics); Algorithm; Offset (computer science); Sequential decoding; List decoding; Optimization problem; Mathematical optimization; Theoretical computer science; Mathematics; Concatenated error correction code; Block code","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.001132187,0.0001026798,0.0001168765,0.0001839183,0.0003321622,0.0001118636,0.0009293508,0.00002759613,0.0002328546],"category_scores_gemma":[0.0001459663,0.0001091852,0.00005354141,0.0006949452,0.00001324757,0.0003347218,0.001010363,0.0001810563,0.000005688356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001553854,"about_ca_system_score_gemma":0.0000412453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002316572,"about_ca_topic_score_gemma":0.000003271347,"domain_scores_codex":[0.9986231,0.0003410628,0.0002114486,0.0003604048,0.0002493786,0.0002146025],"domain_scores_gemma":[0.9990397,0.0002416875,0.0001013321,0.0005137339,0.00005475396,0.00004876925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001276604,0.0003365583,0.0005906398,0.00001584063,0.00002802179,0.00002945259,0.002929273,0.1084546,0.02834566,0.06533854,0.02398349,0.7699351],"study_design_scores_gemma":[0.00007146132,0.0001253697,0.000009486444,0.000003146876,0.000002964074,0.00004357128,0.00008657655,0.9688645,0.0218697,0.002199674,0.006556781,0.0001667527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006482707,0.0000301499,0.9787057,0.0007008348,0.0006960667,0.0001227181,5.48124e-7,0.001555375,0.01754032],"genre_scores_gemma":[0.1131071,0.000001630392,0.8855516,0.0005990543,0.00002254017,0.00004010035,0.000002850738,0.00001167715,0.0006634212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8604099,"threshold_uncertainty_score":0.4452441,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04782323796031018,"score_gpt":0.3366120719809046,"score_spread":0.2887888340205945,"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."}}