{"id":"W2157927886","doi":"10.1109/tit.2014.2334657","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Node (physics); Variable (mathematics); Set (abstract data type); Characterization (materials science); Tanner graph; Graph; Class (philosophy); Simple (philosophy); Code (set theory); Discrete mathematics; Combinatorics; Decoding methods; Mathematics; Theoretical computer science; Algorithm; Error floor; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.0003219149,0.0003163543,0.0003941779,0.001368704,0.0007980787,0.000932353,0.0006504516,0.0005042453,0.003035699],"category_scores_gemma":[0.002788327,0.0003123918,0.0005432343,0.0007737122,0.001347272,0.001496538,0.0008997362,0.0009001619,0.0002682209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006475127,"about_ca_system_score_gemma":0.0003915489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007893115,"about_ca_topic_score_gemma":0.0006191036,"domain_scores_codex":[0.9996004,0.00006610369,0.00002380552,0.0001163458,0.0001154172,0.00007796075],"domain_scores_gemma":[0.9976376,0.001212128,0.0004456321,0.0002223438,0.0002687984,0.0002134951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001602472,0.0001064612,0.008101442,0.0002200323,0.0000372038,0.0005739607,0.001040293,0.05642751,0.02680065,0.8776255,0.001608834,0.0272978],"study_design_scores_gemma":[0.0000388093,0.000186898,0.005600345,0.00008355081,0.00004101026,0.001108735,0.0004274594,0.3533945,0.01474187,0.6169753,0.007334735,0.00006663094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6724246,0.0003840217,0.3108873,0.0002403949,0.00003232765,0.0001082685,0.000526982,0.0002576485,0.01513845],"genre_scores_gemma":[0.9618521,0.0002778713,0.03289215,0.0001052742,0.00005067917,0.0001099801,0.0005960579,0.00009137775,0.004024434],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003035699,"threshold_uncertainty_score":0.01015538,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006652840438808025,"score_gpt":0.2176007685741675,"score_spread":0.2109479281353595,"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."}}