{"id":"W1813544306","doi":"10.1109/icc.2001.936269","title":"A heuristic search for good low-density parity-check codes at short block lengths","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Low-density parity-check code; Tanner graph; Heuristic; Computer science; Block code; Algorithm; Degree distribution; Block size; Block (permutation group theory); Degree (music); Mathematics; Theoretical computer science; Decoding methods; Combinatorics; Error floor","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.0006479931,0.0002265905,0.0002856952,0.0001175884,0.0003299062,0.0001537962,0.001083993,0.000130266,0.00004995078],"category_scores_gemma":[0.0001751689,0.0002161373,0.0001393259,0.0003372454,0.00007270776,0.0002336035,0.0007434459,0.0002597835,0.0001534067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001632137,"about_ca_system_score_gemma":0.00002917186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301709,"about_ca_topic_score_gemma":0.0003544668,"domain_scores_codex":[0.9979748,0.00009249181,0.0002978063,0.0006969371,0.0003601757,0.0005777469],"domain_scores_gemma":[0.9981252,0.000522088,0.00004377415,0.0009171992,0.0002266172,0.0001650982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001634695,0.003820287,0.1437985,0.001135237,0.0004086341,0.0004511445,0.01060213,0.0003443412,0.04782839,0.2320138,0.3866046,0.1728295],"study_design_scores_gemma":[0.0005306994,0.0006405575,0.003771415,0.0001016138,0.00003526396,0.0002688729,0.00006221933,0.645386,0.3390142,0.003712269,0.005394512,0.001082383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.330855,0.0001119527,0.6442416,0.001379391,0.0004234722,0.0008805115,0.000006665401,0.002742083,0.01935933],"genre_scores_gemma":[0.9058306,0.00002103638,0.08883164,0.0002878914,0.00007411147,0.00004858737,0.000001756138,0.00002186156,0.004882557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6450416,"threshold_uncertainty_score":0.8813823,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0426256018935306,"score_gpt":0.2862079065260987,"score_spread":0.2435823046325681,"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."}}