{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656598,0.001586199,0.001083637,0.002480525,0.0009746635,0.00134769,0.001732929,0.001195889,0.002951901],"category_scores_gemma":[0.009407314,0.0008135766,0.001419414,0.001757954,0.002335764,0.003367671,0.003730667,0.003961886,0.0008891633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135137,"about_ca_system_score_gemma":0.0006830762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009078399,"about_ca_topic_score_gemma":0.001335363,"domain_scores_codex":[0.9990037,0.00022913,0.00006821603,0.0002586616,0.0003161912,0.0001240442],"domain_scores_gemma":[0.9926918,0.004814622,0.0005555036,0.001127674,0.0005432003,0.0002672049],"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.0001422855,0.0001195603,0.00176196,0.0005775179,0.00009764155,0.0004821199,0.0006154075,0.1824327,0.03536068,0.7160683,0.005444914,0.05689686],"study_design_scores_gemma":[0.00002263158,0.0001798923,0.001036281,0.0001363206,0.0000806298,0.0006210037,0.0001474093,0.4456861,0.01937321,0.5200136,0.01261233,0.00009056793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03476945,0.001125032,0.9537199,0.0002817068,0.00009524744,0.00007490395,0.000312045,0.0003708744,0.009250854],"genre_scores_gemma":[0.5665189,0.004055304,0.4170813,0.0007664707,0.0003852614,0.0006686675,0.001239501,0.0008267863,0.008457773],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002951901,"threshold_uncertainty_score":0.009875059,"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."}}