{"id":"W2167390843","doi":"10.1109/isit.1998.708677","title":"Acyclic Tanner graphs and two-level decoding of linear block codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tanner graph; Decoding methods; Computer science; Block code; Block (permutation group theory); Directed acyclic graph; List decoding; Linear code; Code (set theory); Combinatorics; Concatenated error correction code; Mathematics; 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.0002242958,0.0001152611,0.0001640308,0.0001514639,0.0000821343,0.0000406662,0.0004827974,0.00004506268,0.00002265132],"category_scores_gemma":[0.0000813575,0.0001005992,0.00004569851,0.0003480227,0.00005524586,0.0002446338,0.0002521251,0.0001071772,0.0000101259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001036485,"about_ca_system_score_gemma":0.000005907986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001019585,"about_ca_topic_score_gemma":0.00005534206,"domain_scores_codex":[0.9991027,0.00003474552,0.0002157217,0.0002835278,0.0001663163,0.0001970234],"domain_scores_gemma":[0.9992175,0.0001527025,0.00008366525,0.0004115925,0.00007171043,0.00006288051],"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.00001556564,0.0007109845,0.1049253,0.0001863289,0.0001633735,0.0000786152,0.01133441,0.0002609813,0.1415031,0.3323499,0.02315699,0.3853144],"study_design_scores_gemma":[0.0005935407,0.000248184,0.003805077,0.0001201506,0.00001767512,0.0001526697,0.00008567812,0.7520916,0.2252059,0.01629299,0.0007883065,0.0005981876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5832279,0.0003248354,0.3983625,0.000645846,0.000233892,0.0001907701,0.000002079182,0.001228268,0.01578391],"genre_scores_gemma":[0.7086363,0.00003575118,0.2906441,0.0001284349,0.000009653902,0.000003400238,1.005849e-7,0.000006396775,0.0005358841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7518306,"threshold_uncertainty_score":0.4102317,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05528422640267773,"score_gpt":0.2823440253638278,"score_spread":0.2270597989611501,"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."}}