{"id":"W3089835555","doi":"10.1109/tcomm.2020.3028302","title":"Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"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; Tanner graph; Algorithm; Error floor; Computer science; Block code; Set (abstract data type); Block (permutation group theory); Graph; Decoding methods; Mathematics; Theoretical computer science; Combinatorics","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.0001396977,0.0002407603,0.0002197236,0.0003340193,0.0002663567,0.0002471678,0.0003420517,0.0002639146,0.0006130651],"category_scores_gemma":[0.0004941902,0.0001531351,0.0001638961,0.0003652664,0.000441259,0.0002349554,0.0002981841,0.0003382586,0.000194621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005140672,"about_ca_system_score_gemma":0.0008136631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001297512,"about_ca_topic_score_gemma":0.002045131,"domain_scores_codex":[0.9998837,0.00001979612,0.000005660756,0.00002204906,0.00005198841,0.00001691129],"domain_scores_gemma":[0.9996947,0.00007666532,0.00005794457,0.00005617482,0.00008715458,0.0000274112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00029369,0.0000894882,0.002452346,0.0004604844,0.00004823904,0.0005982345,0.0002750447,0.4768437,0.3361542,0.09900507,0.00193535,0.08184412],"study_design_scores_gemma":[0.00002797726,0.0001457171,0.0006162903,0.00001233182,0.00001636352,0.0002838137,0.0000195809,0.9248154,0.06269501,0.006394374,0.0049497,0.00002347231],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2473655,0.0002956716,0.7429404,0.0002081244,0.00005744529,0.0001219557,0.000284951,0.0007606692,0.007965426],"genre_scores_gemma":[0.7643226,0.0002503984,0.2322351,0.00007878653,0.00001078866,0.000096776,0.0002582527,0.00006625854,0.002681129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001297512,"threshold_uncertainty_score":0.003729761,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03212018938070391,"score_gpt":0.2695646230738625,"score_spread":0.2374444336931586,"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."}}