{"id":"W2299446443","doi":"10.1109/tit.2016.2523979","title":"Efficient Search of Girth-Optimal QC-LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Girth (graph theory); Mathematics; Tanner graph; Block code; Concatenated error correction code; Combinatorics; Discrete mathematics; Block (permutation group theory); Upper and lower bounds; Linear code; Decoding methods; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009518401,0.0001289254,0.0001373307,0.0004223849,0.0001445539,0.00004654984,0.0005553697,0.00007852252,0.0000818784],"category_scores_gemma":[0.00002309044,0.00009503371,0.0001019126,0.0003728168,0.0001132747,0.0007374388,0.000005904138,0.0001521876,0.0002294448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009140583,"about_ca_system_score_gemma":0.00008268187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001081103,"about_ca_topic_score_gemma":0.000001739818,"domain_scores_codex":[0.9987284,0.0001350693,0.0003949876,0.0001388823,0.0003841553,0.0002185173],"domain_scores_gemma":[0.9986053,0.0004403791,0.0001317038,0.0005366064,0.0002202308,0.00006578312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001892271,0.0002334549,0.00001209391,0.0000716655,0.00005461121,0.000001151048,0.008250663,0.07547378,0.009380896,0.1095685,0.0002577252,0.7965062],"study_design_scores_gemma":[0.0006491084,0.0003862355,0.0001378551,0.0001839904,0.00001275622,0.0000266166,0.0003474156,0.08355824,0.9113414,0.002509744,0.0005264143,0.0003201884],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03879605,0.000004099079,0.9573976,0.0002002286,0.0004093439,0.00019839,0.00002138829,0.000494021,0.00247882],"genre_scores_gemma":[0.9795384,0.00000802049,0.02010359,0.0001114723,0.000008510087,0.00003139638,4.870152e-7,0.000006513593,0.0001916265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9407423,"threshold_uncertainty_score":0.3875362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01162905658006248,"score_gpt":0.2484669592249792,"score_spread":0.2368379026449167,"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."}}