{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979065,0.0001188582,0.0002368193,0.0002363813,0.0000817307,0.00002566051,0.003649618,0.00006252066,0.000004983693],"category_scores_gemma":[0.00006481091,0.000132563,0.00009698922,0.0004716403,0.0002604516,0.0002457411,0.0005002284,0.0002373732,0.000008420232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004446946,"about_ca_system_score_gemma":0.00004820522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001942024,"about_ca_topic_score_gemma":0.00008172628,"domain_scores_codex":[0.9988294,0.0002041509,0.0004215719,0.0002103817,0.0001763066,0.0001581981],"domain_scores_gemma":[0.9948635,0.0004213517,0.0003803906,0.004150695,0.0001526552,0.00003140441],"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.00001009198,0.000179193,0.01841735,0.0001432032,0.0001012334,9.177418e-7,0.003829651,0.0004794119,0.9122322,0.03077438,0.003198846,0.03063358],"study_design_scores_gemma":[0.001716828,0.0003639185,0.01959075,0.001224548,0.000090448,0.0001336104,0.0007798934,0.09615241,0.862661,0.01117149,0.004864012,0.00125106],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6420605,0.0001215462,0.3488996,0.005687529,0.0003734679,0.0003158603,0.00001050948,0.0003285466,0.0022024],"genre_scores_gemma":[0.6592856,0.00003655358,0.3403941,0.0002464015,0.000005267235,0.00001259058,0.000003046617,0.000007784881,0.000008637279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.095673,"threshold_uncertainty_score":0.678196,"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."}}