{"id":"W2886278004","doi":"10.1109/isit.2018.8437485","title":"Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Subcategory; Decoding methods; Error floor; Trapping; Code (set theory); Gaussian; Computer science; Mathematics; Discrete mathematics; Channel (broadcasting); Algorithm; Combinatorics; Physics; Set (abstract data type); Telecommunications; Biology","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819565,0.0006178492,0.000985134,0.0006788413,0.001212804,0.00239087,0.001482684,0.001572856,0.001900536],"category_scores_gemma":[0.009414341,0.0007659004,0.0008535921,0.0009878742,0.001805713,0.00422679,0.001922518,0.001776375,0.0003401651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009762718,"about_ca_system_score_gemma":0.001078678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001253056,"about_ca_topic_score_gemma":0.001444113,"domain_scores_codex":[0.9989863,0.0001858494,0.00008266592,0.0003183557,0.0002484136,0.000178361],"domain_scores_gemma":[0.9871821,0.0102574,0.0009398395,0.0009393346,0.0004247607,0.0002565943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009769595,0.0004071138,0.0112027,0.001453743,0.0002625135,0.001123411,0.001285906,0.6106458,0.0317135,0.2123224,0.009227117,0.1193789],"study_design_scores_gemma":[0.00007103396,0.0001124861,0.001366594,0.0000690815,0.00005099437,0.0005554925,0.0003514576,0.6424862,0.01283041,0.339101,0.002964606,0.00004051892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5517285,0.0007354429,0.4341597,0.001711251,0.00004998517,0.0002464336,0.001314352,0.0008982821,0.009155908],"genre_scores_gemma":[0.8966737,0.0005223454,0.09709117,0.0003305841,0.00006409623,0.0002077631,0.001295961,0.0001314877,0.003682927],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00239087,"threshold_uncertainty_score":0.007083356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04150145517598843,"score_gpt":0.310448073592786,"score_spread":0.2689466184167976,"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."}}