{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004890405,0.000443859,0.000632434,0.001017908,0.0005484505,0.0004278212,0.0005831459,0.0006402374,0.001212409],"category_scores_gemma":[0.003171614,0.0003361422,0.0003347812,0.0006828441,0.0005959498,0.0005772345,0.000503654,0.0004171072,0.0003429613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003569535,"about_ca_system_score_gemma":0.0009549205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006765869,"about_ca_topic_score_gemma":0.002077421,"domain_scores_codex":[0.9997535,0.00008298235,0.00001218402,0.00005390534,0.0000609018,0.00003655685],"domain_scores_gemma":[0.9986766,0.0008096253,0.0001324462,0.000147896,0.0001509798,0.000082413],"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.0008135086,0.0002878865,0.009341419,0.0004288179,0.0001480923,0.0006036164,0.0004104644,0.685012,0.07573278,0.03555826,0.004988072,0.1866751],"study_design_scores_gemma":[0.0002077109,0.0004146406,0.001110523,0.00003574247,0.00007070162,0.0003253234,0.0001471647,0.9486402,0.01639048,0.0302547,0.002369965,0.00003275771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4737951,0.0006048935,0.5194435,0.0003557085,0.00005326631,0.0001571266,0.0002302484,0.0007892841,0.004570845],"genre_scores_gemma":[0.695947,0.0002194756,0.301508,0.0001468393,0.00002766124,0.0002392189,0.0005027254,0.0001034994,0.00130565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001212409,"threshold_uncertainty_score":0.004055917,"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."}}