{"id":"W2558776151","doi":"10.1109/isit.2017.8006717","title":"Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Characterization (materials science); Low-density parity-check code; Computer science; Terminology; Simple (philosophy); Algorithm; Code (set theory); Ranging; Representation (politics); Theoretical computer science; Decoding methods; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005063338,0.00009794937,0.0001478949,0.00009363816,0.000288102,0.0001297094,0.0005305454,0.00003937403,0.000003598186],"category_scores_gemma":[0.00002567666,0.00009216076,0.00003460766,0.00005802462,0.00007657449,0.0002758166,0.000294549,0.00005715009,5.523866e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002514143,"about_ca_system_score_gemma":0.00002951883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000697226,"about_ca_topic_score_gemma":0.000006761186,"domain_scores_codex":[0.9991328,0.0000229257,0.00017652,0.0002987395,0.0001807672,0.0001882132],"domain_scores_gemma":[0.9991432,0.00005884032,0.0001422896,0.000462294,0.0001489105,0.00004446306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007081139,0.00007347857,0.001445165,0.0000564094,0.00002627402,0.000002336737,0.001410298,0.00001162965,0.1109892,0.002674902,0.00006222454,0.883241],"study_design_scores_gemma":[0.0002391415,0.0001379402,0.01810947,0.00005998277,0.000006690468,0.000005346235,0.0000856724,0.629931,0.3509917,0.0002129672,0.00009470724,0.0001253276],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2613221,0.000008558582,0.7377877,0.0002201946,0.00009556558,0.000344492,0.000009916384,0.0001087355,0.0001028356],"genre_scores_gemma":[0.6670641,0.000007284681,0.332745,0.00004104019,0.00001909543,0.00002482725,0.000009064336,0.000006681787,0.00008289902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8831156,"threshold_uncertainty_score":0.3758207,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03076213999121107,"score_gpt":0.3109040462150831,"score_spread":0.280141906223872,"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."}}