{"id":"W2043309691","doi":"10.1049/ip-com:20000663","title":"Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes","year":2000,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tanner graph; Decoding methods; List decoding; Coset; Sequential decoding; Block code; Linear code; Mathematics; Hamming code; Concatenated error correction code; Combinatorics; Discrete mathematics; Algorithm","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.0004498642,0.000159402,0.0002078912,0.0002180118,0.0005230682,0.0001292519,0.002125441,0.00007358127,0.00002996453],"category_scores_gemma":[0.00004481184,0.0001597096,0.00009634776,0.0009230482,0.0002980423,0.0005398197,0.0004702548,0.0002375676,0.00001491835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001058019,"about_ca_system_score_gemma":0.00002317863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002365962,"about_ca_topic_score_gemma":0.000009192947,"domain_scores_codex":[0.9989173,0.00003183912,0.0003340608,0.0002861278,0.0001680274,0.0002625858],"domain_scores_gemma":[0.9985184,0.000173061,0.000136446,0.0008869892,0.0001721971,0.0001129112],"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.00002759332,0.0004356727,0.009700733,0.00007478683,0.000113145,7.152592e-7,0.007056893,0.000008130753,0.01141528,0.7984645,0.0009013205,0.1718012],"study_design_scores_gemma":[0.001146952,0.0003388319,0.007317109,0.0003569551,0.0001184001,0.000117093,0.0007053519,0.0328516,0.009365157,0.9021941,0.04459294,0.0008955589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9634989,0.001920981,0.003501118,0.003315707,0.00007020576,0.0003320187,0.00001376697,0.0004837042,0.02686361],"genre_scores_gemma":[0.9331178,0.001262908,0.06533968,0.0001649168,0.00001284491,0.0000341692,0.000002639358,0.00001216768,0.00005284083],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1709056,"threshold_uncertainty_score":0.651277,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01849388440117623,"score_gpt":0.2588540239813282,"score_spread":0.240360139580152,"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."}}