{"id":"W2066943407","doi":"10.1109/icc.2004.1312528","title":"Reliability-based schedule for decoding low-density parity-check codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Computer science; Schedule; Low-density parity-check code; Flooding (psychology); Tanner graph; Binary number; Reliability (semiconductor); Sequential decoding; List decoding; Algorithm; Parallel computing; Theoretical computer science; Concatenated error correction code; Arithmetic; Mathematics; Block code","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.000994264,0.0001846156,0.0002313755,0.0001078306,0.0002514406,0.0001604518,0.0008770683,0.0001187573,0.000006211316],"category_scores_gemma":[0.0005214453,0.0001753101,0.0001445503,0.0003332312,0.00006407975,0.0004074539,0.0002114785,0.0001963177,0.00002935897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002068772,"about_ca_system_score_gemma":0.000220786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001827341,"about_ca_topic_score_gemma":0.0002227081,"domain_scores_codex":[0.9984192,0.00004820636,0.0002858645,0.0006108107,0.0002380654,0.0003978602],"domain_scores_gemma":[0.9982662,0.0003200779,0.00009511492,0.0009443373,0.0002616513,0.0001125987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001456289,0.001870934,0.02387697,0.0007135288,0.00006125923,0.00004643017,0.001621631,0.009202098,0.08829566,0.8385367,0.005246778,0.03038241],"study_design_scores_gemma":[0.0007780004,0.0002174791,0.001175849,0.0001042694,0.000009441499,0.000008921027,0.00002889179,0.1122608,0.7969721,0.08752321,0.0004701256,0.00045094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2099543,0.000009389553,0.7858573,0.001085583,0.0002530767,0.000353116,0.000001196352,0.001713127,0.0007728852],"genre_scores_gemma":[0.5150735,6.150029e-7,0.4842939,0.0005275473,0.00002302735,0.0000313377,0.000001351086,0.000008687583,0.00004003668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7510135,"threshold_uncertainty_score":0.7148937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02103729412018669,"score_gpt":0.283878375669828,"score_spread":0.2628410815496414,"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."}}