{"id":"W2505549722","doi":"10.1109/icc.2016.7511551","title":"An efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Algorithm; Computer science; Search algorithm; Variable (mathematics); Simple (philosophy); Graph; Code (set theory); Decoding methods; Theoretical computer science; Mathematics; Error floor; Set (abstract data type)","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.001173253,0.0001619498,0.0002219848,0.0001846163,0.0001110115,0.00004021814,0.0009582075,0.00006576658,0.00003382213],"category_scores_gemma":[0.00002685556,0.0001161531,0.00006941638,0.0003339335,0.00007740625,0.000295416,0.0002052472,0.0000694847,0.000003201452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009425759,"about_ca_system_score_gemma":0.000106965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001475618,"about_ca_topic_score_gemma":0.00000710285,"domain_scores_codex":[0.9983217,0.00008086703,0.0003126653,0.0005167453,0.0003564721,0.0004115872],"domain_scores_gemma":[0.9985405,0.0003006759,0.00009349582,0.0006670064,0.0002949985,0.000103382],"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.00002078224,0.000391335,0.0004863678,0.00005284095,0.00007321437,0.000005178396,0.001262091,0.0003739299,0.1371101,0.03249245,0.001239397,0.8264923],"study_design_scores_gemma":[0.0004850948,0.0005663637,0.0002614943,0.0001189938,0.00001069374,0.000009018579,0.0001929402,0.5260619,0.4692394,0.002620956,0.0001961156,0.0002370126],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02821493,0.00001848519,0.9699262,0.0002181768,0.0001604202,0.0005426602,0.00002379591,0.0005022204,0.0003931341],"genre_scores_gemma":[0.3293268,0.00000230168,0.6704057,0.0000799092,0.0000270499,0.00004452431,0.000002741676,0.00001194005,0.00009900117],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8262553,"threshold_uncertainty_score":0.4736586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02255639370847612,"score_gpt":0.3030182334455154,"score_spread":0.2804618397370393,"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."}}