{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504108,0.00009713602,0.0001151854,0.000214203,0.000476975,0.0001901815,0.0008114324,0.0000608134,0.00003046281],"category_scores_gemma":[0.00003308076,0.00009299399,0.00007661867,0.0000789059,0.00008049374,0.003020966,0.000005525589,0.0001475705,0.00006063065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003631345,"about_ca_system_score_gemma":0.00003804172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001816026,"about_ca_topic_score_gemma":0.000007445857,"domain_scores_codex":[0.9992633,0.00003919124,0.0002829841,0.00009214297,0.0001929559,0.0001294579],"domain_scores_gemma":[0.9986132,0.0001429056,0.000290454,0.0007948632,0.0001193079,0.00003929678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004890172,0.00007174907,0.00004827743,0.00005194588,0.00003871831,6.798314e-7,0.006974492,0.003148857,0.00130635,0.08488018,0.0002031952,0.9032267],"study_design_scores_gemma":[0.0007028996,0.0002214344,0.0008924485,0.0002125686,0.00002288597,0.00003070886,0.0008227684,0.0586638,0.9033934,0.03395442,0.0006293062,0.0004533358],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007543072,0.000002815154,0.9786197,0.00009464236,0.0006187703,0.0001171552,0.000005772013,0.0003038998,0.01269418],"genre_scores_gemma":[0.9808879,0.00001045438,0.01879571,0.0001281248,0.000008309376,0.00002304407,4.61336e-7,0.000004409049,0.0001415336],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9733449,"threshold_uncertainty_score":0.3792185,"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."}}