{"id":"W2734950220","doi":"10.1109/tit.2017.2726064","title":"Fast Decoding of Expander Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Clemson University","keywords":"Expander graph; Decoding methods; List decoding; Mathematics; Linear code; Sequential decoding; Berlekamp–Welch algorithm; Combinatorics; Bipartite graph; Expander code; Concatenated error correction code; Algorithm; Block code; Discrete mathematics; Vertex (graph theory); Tanner graph; Graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053033,0.001000699,0.001249833,0.001140805,0.0006361845,0.001158824,0.0009168106,0.001235942,0.002954881],"category_scores_gemma":[0.009770764,0.0004915292,0.0006564551,0.001272732,0.0009059487,0.002400498,0.002221559,0.00217741,0.001731608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001048585,"about_ca_system_score_gemma":0.00132014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002285539,"about_ca_topic_score_gemma":0.002623458,"domain_scores_codex":[0.9978459,0.0003976929,0.0001079575,0.0004638478,0.0008550665,0.0003294997],"domain_scores_gemma":[0.9934143,0.003659446,0.0004534936,0.001246152,0.001107006,0.0001196103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001077887,0.0001393939,0.001621699,0.000402902,0.0001146723,0.0007970433,0.0006307074,0.3096251,0.0813033,0.2541806,0.01284719,0.3372595],"study_design_scores_gemma":[0.0000713189,0.0001017428,0.0004335844,0.0000562581,0.00002474244,0.0003742657,0.00005772799,0.8128425,0.04031315,0.1378047,0.007871339,0.0000485499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04014843,0.0004925555,0.9505123,0.000320311,0.00008851091,0.00008807331,0.0003401542,0.00160573,0.006403894],"genre_scores_gemma":[0.4060489,0.0009694169,0.5743911,0.0004953943,0.0002145852,0.000333501,0.001455434,0.0004893247,0.01560238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002954881,"threshold_uncertainty_score":0.009885013,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01820089463018002,"score_gpt":0.2744818576096896,"score_spread":0.2562809629795096,"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."}}