{"id":"W2008314255","doi":"10.1109/istc.2014.6955086","title":"On characterization of elementary trapping sets of variable-regular LDPC codes","year":2014,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Variable (mathematics); Node (physics); Set (abstract data type); Graph; Characterization (materials science); Code (set theory); Class (philosophy); Simple (philosophy); Tanner graph; Discrete mathematics; Decoding methods; Combinatorics; Parallel computing; Theoretical computer science; Mathematics; Algorithm; Error floor; Statistics; Programming language","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.0003865284,0.0004162159,0.0004833383,0.001691628,0.0008575571,0.001015015,0.0008105762,0.0005948322,0.003245482],"category_scores_gemma":[0.003765833,0.0003835337,0.0006778261,0.0009493523,0.001513316,0.001708932,0.0009882225,0.0009958071,0.0002710597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000706517,"about_ca_system_score_gemma":0.0004325855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009523001,"about_ca_topic_score_gemma":0.000724401,"domain_scores_codex":[0.9994866,0.00008829146,0.00003116171,0.0001543393,0.0001397497,0.00009979309],"domain_scores_gemma":[0.9966888,0.001880107,0.000576386,0.0002529285,0.0003139944,0.0002877621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002136659,0.0001408368,0.01010584,0.0002970611,0.00005667131,0.0007461426,0.001191521,0.08419687,0.02675274,0.8463908,0.001843626,0.02806426],"study_design_scores_gemma":[0.0000474684,0.0001974512,0.005437141,0.00008642203,0.00005200771,0.001168152,0.0003799843,0.4173773,0.01117931,0.5585374,0.005465388,0.00007194902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6842632,0.0004721798,0.3004836,0.0002460934,0.00003088866,0.0001127666,0.0005005261,0.0002413211,0.01364953],"genre_scores_gemma":[0.9657158,0.0003585674,0.02932525,0.0001105077,0.00005426056,0.0001154449,0.0005903633,0.00009400346,0.003635895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003245482,"threshold_uncertainty_score":0.01085716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009991899201599373,"score_gpt":0.2346776725605677,"score_spread":0.2246857733589684,"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."}}