{"id":"W2969069694","doi":"10.1109/lcomm.2019.2933828","title":"Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Ontario Trillium Foundation","keywords":"Low-density parity-check code; Tanner graph; Girth (graph theory); Block code; Linear code; Code (set theory); Tornado code; Computer science; Concatenated error correction code; Mathematics; Discrete mathematics; Raptor code; Combinatorics; Decoding methods; Algorithm; Set (abstract data type)","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.0002458995,0.0003029093,0.0002823424,0.0003843142,0.0003681579,0.0002836807,0.0005657063,0.0003640984,0.0008321361],"category_scores_gemma":[0.0006721138,0.0001959592,0.0002882935,0.0003287133,0.0005186536,0.0003553788,0.0006112771,0.0006033611,0.0002315396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000439467,"about_ca_system_score_gemma":0.001085681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007785325,"about_ca_topic_score_gemma":0.001312559,"domain_scores_codex":[0.999824,0.00003255426,0.000009957269,0.00002599916,0.00008423175,0.00002320256],"domain_scores_gemma":[0.9995872,0.0001273992,0.00007228534,0.00009465741,0.00008822359,0.00003023921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002098887,0.0001470906,0.002549201,0.0006227747,0.00008516125,0.0007608212,0.0004103058,0.2172691,0.432517,0.2297409,0.001936898,0.1137508],"study_design_scores_gemma":[0.00009546359,0.0002633864,0.0008697038,0.00004772727,0.00004853581,0.0007172946,0.00004279832,0.7599375,0.1976796,0.02860969,0.01161939,0.00006889283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1980741,0.0004335463,0.7924939,0.0002846057,0.00007705302,0.0001596975,0.0001666826,0.0004216252,0.007888853],"genre_scores_gemma":[0.6334569,0.0003169895,0.3624099,0.0001284895,0.00001701804,0.0001759654,0.0001951925,0.00005454358,0.003245004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008321361,"threshold_uncertainty_score":0.00318855,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03327658837706519,"score_gpt":0.2668818608246346,"score_spread":0.2336052724475694,"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."}}