{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002132221,0.0002918953,0.0002063141,0.0007950118,0.0004141519,0.0007428745,0.0004607479,0.0004964233,0.0019591],"category_scores_gemma":[0.001431021,0.0002157763,0.0003103228,0.0008152914,0.0006584916,0.0006365903,0.0004672476,0.000681051,0.0006060295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005226997,"about_ca_system_score_gemma":0.0005316455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00224056,"about_ca_topic_score_gemma":0.004425446,"domain_scores_codex":[0.9996463,0.00009706974,0.00002573989,0.00006290845,0.0001040795,0.00006393813],"domain_scores_gemma":[0.9993544,0.0002780297,0.00009231266,0.0001443609,0.00009884492,0.00003199762],"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.0001232162,0.00005641934,0.000571469,0.0001641039,0.00002622407,0.0002972683,0.0003428961,0.0798168,0.03215704,0.7669687,0.002220805,0.1172551],"study_design_scores_gemma":[0.00002422447,0.00007248433,0.0006598468,0.0000500228,0.00002554172,0.0002740711,0.0000588807,0.2480952,0.03629654,0.7019624,0.01242306,0.00005770111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0697573,0.0003610989,0.9147123,0.0002565633,0.00007927385,0.00006608296,0.00028955,0.0008248252,0.01365302],"genre_scores_gemma":[0.6684053,0.0007102116,0.3131387,0.0003072081,0.00005781189,0.0001516865,0.0004813913,0.0002046018,0.0165432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00224056,"threshold_uncertainty_score":0.006553769,"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."}}