{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004085226,0.0007057622,0.0007155344,0.0004632737,0.0002999101,0.0005655236,0.0008352948,0.0007005228,0.003929858],"category_scores_gemma":[0.002089293,0.0003581705,0.0003789714,0.0006973177,0.0004688801,0.0006495908,0.0007847187,0.0009208824,0.0008614197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008346444,"about_ca_system_score_gemma":0.001299677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002330882,"about_ca_topic_score_gemma":0.002975653,"domain_scores_codex":[0.9997513,0.0000681968,0.00001368591,0.00004054512,0.00009976681,0.0000265693],"domain_scores_gemma":[0.9993523,0.0004247969,0.00003683834,0.00005453046,0.0001143104,0.00001723234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003507647,0.0000243601,0.0002427806,0.0001584149,0.00002247624,0.000044828,0.00006133926,0.835884,0.002558962,0.06737132,0.001743346,0.09185298],"study_design_scores_gemma":[0.000007129782,0.000007346123,0.00002845504,0.000009319817,0.000002755448,0.00001232106,0.000004865419,0.9886993,0.0008996651,0.009214739,0.001110186,0.000003944017],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003591647,0.000304616,0.9915425,0.0001043512,0.00002085321,0.00002511206,0.00004251267,0.000159322,0.004209158],"genre_scores_gemma":[0.2388579,0.0007973583,0.7493644,0.0001585968,0.00005132638,0.0002504744,0.0002224447,0.0003121696,0.009985346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003929858,"threshold_uncertainty_score":0.0131467,"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."}}