{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007462105,0.000100772,0.0001669255,0.0002252776,0.00009202236,0.00002472513,0.001160008,0.00003582763,0.000001057699],"category_scores_gemma":[0.00004360383,0.0001071017,0.00002636124,0.0004433428,0.0001857482,0.0001520644,0.0003309616,0.0001586996,0.00000117084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006852164,"about_ca_system_score_gemma":0.00005436976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001102633,"about_ca_topic_score_gemma":0.000003647332,"domain_scores_codex":[0.9988939,0.0002230024,0.0002961798,0.0001908468,0.0002578784,0.000138254],"domain_scores_gemma":[0.997922,0.0002412625,0.0001842236,0.001413084,0.0001869093,0.00005249637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002547464,0.0003355153,0.001996276,0.00006254544,0.00006300089,0.000001162448,0.008443725,0.003737148,0.9590731,0.0156962,0.0006630155,0.009902857],"study_design_scores_gemma":[0.001189369,0.0005376341,0.01253326,0.0008067038,0.00005869664,0.00002286776,0.0007242689,0.4802069,0.5017475,0.001025992,0.0005551501,0.000591673],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5557657,0.00002861685,0.4419843,0.001780036,0.00006091193,0.0001936088,0.000009003565,0.00007542771,0.0001024142],"genre_scores_gemma":[0.9052908,0.00001788739,0.09422039,0.0004093882,0.000005574939,0.00002113058,0.00002209389,0.00000812095,0.000004547868],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4764697,"threshold_uncertainty_score":0.436748,"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."}}