{"id":"W2963924687","doi":"10.1109/isit.2018.8437465","title":"From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","year":2018,"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; Mathematics; Trapping; Girth (graph theory); Combinatorics; Upper and lower bounds; Minimum weight; Discrete mathematics; Degree (music); Minimum distance; Cage; Graph theory; Decoding methods; Algorithm; Physics","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.0005465267,0.0002995874,0.0004395329,0.0001888034,0.0001587564,0.0001102363,0.001208628,0.0001242363,0.00003739447],"category_scores_gemma":[0.0004031838,0.0002258646,0.00009185079,0.000751417,0.0001937919,0.000277242,0.0003723954,0.0001746316,0.000005353978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005945214,"about_ca_system_score_gemma":0.0001283691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007105066,"about_ca_topic_score_gemma":0.0005741327,"domain_scores_codex":[0.9979024,0.0001356825,0.0005077161,0.0006866067,0.0003835023,0.0003840923],"domain_scores_gemma":[0.9972936,0.001135213,0.0002092444,0.0009972018,0.0001854095,0.0001793434],"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.0001515705,0.0001618169,0.001293636,0.00008068055,0.0001104877,0.000009905873,0.04773627,0.000005494588,0.8890797,0.006415908,0.03411395,0.02084053],"study_design_scores_gemma":[0.0002402044,0.001014485,0.003381054,0.001063707,0.00002031055,0.0000117545,0.001161159,0.002563494,0.978377,0.008678524,0.002967002,0.0005213377],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3660947,0.00005476108,0.6263933,0.004235361,0.0001348691,0.0007199299,0.00001742879,0.0003105435,0.002039065],"genre_scores_gemma":[0.7952532,0.000007054576,0.203251,0.001100728,0.0000515387,0.00005863752,6.575635e-7,0.00002006338,0.0002571451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4291584,"threshold_uncertainty_score":0.9210491,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0201859941141127,"score_gpt":0.2811892868468568,"score_spread":0.2610032927327441,"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."}}