{"id":"W2167038527","doi":"10.1109/lcomm.2004.827438","title":"Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Binary number; Sequential decoding; Theoretical computer science; Mathematics; Concatenated error correction code; Error floor; Block code; Arithmetic","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.000698096,0.0003702145,0.0003872204,0.0003894125,0.0002543132,0.000673323,0.0008067586,0.0004716568,0.0009567003],"category_scores_gemma":[0.003150668,0.0001646085,0.0002613179,0.0005723778,0.0007324025,0.0008062464,0.0006059671,0.0005528413,0.0002847796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005137728,"about_ca_system_score_gemma":0.0005105481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054929,"about_ca_topic_score_gemma":0.001427631,"domain_scores_codex":[0.9994233,0.0002217575,0.00003141647,0.00007540746,0.0001861283,0.00006209419],"domain_scores_gemma":[0.9979551,0.001182954,0.0001795382,0.0003516099,0.0002686201,0.00006222214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007552205,0.0001449378,0.005017909,0.0002280728,0.0001969655,0.0002903358,0.0004368197,0.4820171,0.07032702,0.1378593,0.001646828,0.3010795],"study_design_scores_gemma":[0.00002784167,0.00008086807,0.0004145781,0.000007944841,0.000014344,0.0001240098,0.00002438926,0.9476599,0.0349755,0.01579104,0.0008640043,0.00001560871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1945659,0.0003255323,0.7968092,0.0001226532,0.0000557142,0.00006233349,0.00006187059,0.0006631377,0.007333695],"genre_scores_gemma":[0.701983,0.0001527428,0.2949028,0.00008365417,0.00002020911,0.00004447944,0.0001052066,0.00006775148,0.002640168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001054929,"threshold_uncertainty_score":0.003727734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03425367630716927,"score_gpt":0.293368421581066,"score_spread":0.2591147452738968,"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."}}