{"id":"W2127204517","doi":"10.1109/tcomm.2004.838738","title":"Threshold Values and Convergence Properties of Majority-Based Algorithms for Decoding Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Binary symmetric channel; Mathematics; Convergence (economics); Binary number; Computer science; Discrete mathematics; 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.001737675,0.0003558054,0.0005243002,0.0007164188,0.000511934,0.0009486869,0.0007791878,0.0008399853,0.0009757543],"category_scores_gemma":[0.01774891,0.0002769072,0.0003740002,0.0005212938,0.001425867,0.001654511,0.0007345054,0.001122691,0.0002326875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001289129,"about_ca_system_score_gemma":0.0006282661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000737221,"about_ca_topic_score_gemma":0.0005166541,"domain_scores_codex":[0.9992777,0.0002399786,0.00003493691,0.0001059007,0.0002591063,0.00008244593],"domain_scores_gemma":[0.9908794,0.007096189,0.0005235751,0.0005024226,0.0008523152,0.0001461012],"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.0002535529,0.0000795282,0.004376545,0.0001539985,0.00004903386,0.0001347266,0.000560296,0.597047,0.01749823,0.3339552,0.0007735551,0.04511834],"study_design_scores_gemma":[0.000009262715,0.00003098672,0.0002998527,0.00001227288,0.000005685397,0.0000567952,0.00002779518,0.965317,0.00469122,0.02924357,0.0002946065,0.00001099788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.406587,0.0008171957,0.5850883,0.0003321849,0.00004281519,0.00007890209,0.0000565981,0.000353712,0.006643244],"genre_scores_gemma":[0.9146738,0.0003767134,0.08316242,0.00005382065,0.00002438033,0.00008663359,0.00006629126,0.00008203617,0.001473885],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001737675,"threshold_uncertainty_score":0.00935334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06376592848633332,"score_gpt":0.2991063240944776,"score_spread":0.2353403956081443,"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."}}