{"id":"W2985618070","doi":"10.1109/tcomm.2019.2953601","title":"Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Error floor; Computer science; Trapping; Algorithm; Theoretical computer science; Decoding methods; Biology","routes":{"ca_aff":true,"ca_fund":true,"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.0004872627,0.0001332667,0.0002955467,0.00030507,0.000186919,0.00003310978,0.000789809,0.00006927035,0.000004955114],"category_scores_gemma":[0.00001110181,0.0001240591,0.000056402,0.0006031318,0.0002272032,0.000194408,0.00001308897,0.0002445284,0.000004950921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008060217,"about_ca_system_score_gemma":0.00007224578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001664516,"about_ca_topic_score_gemma":0.00009058217,"domain_scores_codex":[0.998609,0.0002867191,0.0004249793,0.0002312902,0.0003092072,0.0001387819],"domain_scores_gemma":[0.9974439,0.0004544484,0.0002133449,0.00153586,0.0003068994,0.00004553929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003730833,0.00811062,0.0008319814,0.03939132,0.001375072,0.000002752465,0.05298306,0.1493021,0.6094621,0.04926327,0.0001442294,0.08876041],"study_design_scores_gemma":[0.0005474163,0.0004647784,0.0002932342,0.003796706,0.0000865102,0.00005462764,0.001986575,0.70981,0.2826038,0.0000968041,0.000003583493,0.0002559462],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2447616,0.0001008119,0.7536384,0.0003562606,0.00007570154,0.000680429,0.00002091931,0.0001432672,0.0002225854],"genre_scores_gemma":[0.9372481,0.00006529031,0.0625513,0.00001166702,9.820996e-7,0.00007614012,0.000003231001,0.00001165267,0.00003168553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6924865,"threshold_uncertainty_score":0.5058982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01763362042391541,"score_gpt":0.2714147042690345,"score_spread":0.253781083845119,"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."}}