{"id":"W2774002047","doi":"10.1109/tit.2018.2879823","title":"From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Trapping; Low-density parity-check code; Girth (graph theory); Combinatorics; Upper and lower bounds; Degree (music); Discrete mathematics; Minimum weight; Cage; Minimum distance; Decoding methods; Algorithm; Physics; Biology","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001239586,0.0004226466,0.0005265166,0.0005541082,0.0002885795,0.0001989944,0.0008833091,0.0002835594,0.00002195075],"category_scores_gemma":[0.0001295606,0.0003629475,0.0001408927,0.0004478476,0.0002799863,0.0007231634,0.00005504044,0.0005844273,0.00000558271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001110424,"about_ca_system_score_gemma":0.0001453874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008732577,"about_ca_topic_score_gemma":0.00005015845,"domain_scores_codex":[0.997622,0.0003022196,0.0008765257,0.0004689959,0.0004434119,0.0002868113],"domain_scores_gemma":[0.9963062,0.001699365,0.0005381069,0.001021781,0.0003021452,0.0001323432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002980819,0.0009384092,0.0001083906,0.0035411,0.001512182,0.00001091149,0.5816585,0.01134199,0.0619643,0.02400942,0.006470139,0.3054638],"study_design_scores_gemma":[0.0007557273,0.001305774,0.0009326435,0.007367163,0.0001728238,0.00004069006,0.006010572,0.02258998,0.8959531,0.06192508,0.001315145,0.001631261],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1476677,0.00003285684,0.8485099,0.000751712,0.0004238042,0.001354509,0.0003365925,0.000263359,0.0006595244],"genre_scores_gemma":[0.9570733,0.00005899856,0.04165875,0.0006642324,0.00002044422,0.0004626469,0.000006163103,0.00002232302,0.00003319671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8339888,"threshold_uncertainty_score":0.9998822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01344567266664251,"score_gpt":0.2622321549856071,"score_spread":0.2487864823189646,"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."}}