{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002190468,0.000327913,0.0003080005,0.0004525766,0.0002652199,0.0003777087,0.0005257682,0.0002812849,0.0005516814],"category_scores_gemma":[0.0007130165,0.0002503824,0.0002637503,0.0004628749,0.0004266863,0.0002882281,0.0004179842,0.0003888443,0.0002168019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000565513,"about_ca_system_score_gemma":0.001135966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001042222,"about_ca_topic_score_gemma":0.001573228,"domain_scores_codex":[0.9997852,0.00004022835,0.00001320723,0.00003251161,0.00009807448,0.00003071101],"domain_scores_gemma":[0.9994708,0.0001357877,0.0001196063,0.00009349253,0.0001498593,0.00003041389],"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.0001758111,0.0001428716,0.002364422,0.0004777318,0.00006686261,0.0004026544,0.0002778173,0.2620516,0.5043836,0.09267156,0.001800412,0.1351846],"study_design_scores_gemma":[0.00006163946,0.0002059549,0.0006546826,0.00002738886,0.00003034358,0.0003406722,0.0000256323,0.8322357,0.1533125,0.007530523,0.005538988,0.0000360495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1268162,0.0002275962,0.8680748,0.0001419392,0.00002501977,0.0001147106,0.0001327742,0.0005986854,0.003868243],"genre_scores_gemma":[0.5551936,0.0002553732,0.4420725,0.00008245603,0.00000981856,0.0001783943,0.0001832148,0.00006972079,0.001954923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001042222,"threshold_uncertainty_score":0.004103124,"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."}}