{"id":"W2893800824","doi":"10.1109/icee.2018.8472553","title":"Low Decoding Complexity of LDPC Codes Over the Binary Erasure Channel","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Binary erasure channel; Erasure; Belief propagation; Algorithm; Computer science; Sequential decoding; Binary number; Set (abstract data type); List decoding; Channel (broadcasting); Theoretical computer science; Mathematics; Concatenated error correction code; Block code; Arithmetic; Channel capacity; Telecommunications","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.0005943791,0.0001213691,0.0001564488,0.00007732852,0.0002012248,0.00006021279,0.001236625,0.00005267842,0.00005756361],"category_scores_gemma":[0.00008105604,0.00008104679,0.00006643983,0.0004020745,0.000330501,0.0002562362,0.0005284214,0.0001319401,0.00002092258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002769623,"about_ca_system_score_gemma":0.00003750433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002173826,"about_ca_topic_score_gemma":0.0002461511,"domain_scores_codex":[0.9989514,0.00008748633,0.0002032941,0.0002719671,0.0002538625,0.0002319969],"domain_scores_gemma":[0.9987482,0.0001663854,0.000115777,0.0007526557,0.0001764537,0.00004046779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008653027,0.0009298333,0.02507192,0.0002307053,0.0001953756,0.0000351191,0.02129274,0.00007083639,0.1379791,0.6104845,0.1472476,0.05637575],"study_design_scores_gemma":[0.0002698941,0.0005772459,0.02969823,0.0001694472,0.00001086497,0.0000392736,0.0001721311,0.4657331,0.446958,0.05509048,0.0008287864,0.0004525679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3120352,0.00003856173,0.6734908,0.001033553,0.0005513609,0.0002047793,0.000001985541,0.0007867052,0.01185705],"genre_scores_gemma":[0.9471189,0.000003919953,0.05210189,0.0005034413,0.00008835342,0.00000620826,4.011718e-7,0.000008184478,0.0001687373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6350837,"threshold_uncertainty_score":0.3304992,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05892292607897703,"score_gpt":0.3021827170281456,"score_spread":0.2432597909491686,"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."}}