{"id":"W2021979706","doi":"10.1109/lcomm.2015.2390648","title":"On Characterization and Efficient Exhaustive Search of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"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; Complement (music); Simple (philosophy); Variable (mathematics); Tanner graph; Code (set theory); Mathematics; Characterization (materials science); Decoding methods; Graph; Set (abstract data type); Computer science; Algorithm; Theoretical computer science; Discrete mathematics; Error floor","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.000360315,0.0002698445,0.0003720916,0.0008499504,0.0003597473,0.0005888405,0.0005196787,0.0003453829,0.001588011],"category_scores_gemma":[0.003695091,0.000232355,0.000288765,0.0009499676,0.0006282611,0.0009202325,0.0006484857,0.0004853429,0.0001884113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000414735,"about_ca_system_score_gemma":0.0008152393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001112802,"about_ca_topic_score_gemma":0.001766382,"domain_scores_codex":[0.9996974,0.00006681991,0.00002159433,0.00006382546,0.0001062011,0.00004422811],"domain_scores_gemma":[0.9983726,0.001135662,0.0001512242,0.0001642378,0.0001238109,0.00005252084],"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.0005552658,0.0002350372,0.01050113,0.0004535994,0.00007240343,0.0005271228,0.0006135304,0.520075,0.06294985,0.2273043,0.002747555,0.1739651],"study_design_scores_gemma":[0.00002931596,0.0000755759,0.0009450664,0.00002101044,0.00001293207,0.0001719448,0.00004511531,0.9339725,0.01183572,0.05175918,0.001117025,0.00001446398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4983544,0.0004039352,0.4907463,0.0002254805,0.00001208512,0.0001733202,0.0003586946,0.0004437795,0.009282101],"genre_scores_gemma":[0.8713747,0.000224527,0.1252863,0.00006288,0.00001102836,0.0001390491,0.0005870318,0.00005097571,0.002263562],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001588011,"threshold_uncertainty_score":0.005312443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05075294354137328,"score_gpt":0.3011398942392328,"score_spread":0.2503869506978595,"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."}}