{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537687,0.0002816654,0.0004019651,0.0006459114,0.00037118,0.0003329288,0.0004756927,0.0004592433,0.001188754],"category_scores_gemma":[0.002125603,0.000260376,0.0002861993,0.0004622003,0.000400259,0.0005008989,0.0004585915,0.0003537794,0.000177145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005465708,"about_ca_system_score_gemma":0.001305665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002158196,"about_ca_topic_score_gemma":0.004507394,"domain_scores_codex":[0.9998448,0.00003829359,0.000006250054,0.00002651068,0.00005589381,0.00002829806],"domain_scores_gemma":[0.9993487,0.0004195406,0.00007048092,0.00006469592,0.00006904483,0.00002739079],"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.0002555117,0.0001288649,0.005415519,0.0003333689,0.00006668002,0.0004181977,0.0002725324,0.8035955,0.04493917,0.04839769,0.002083094,0.09409372],"study_design_scores_gemma":[0.00004636164,0.00006496193,0.0007348603,0.00001729497,0.00001234611,0.00008554423,0.00005043554,0.9728737,0.006230727,0.01869225,0.001182274,0.000009122473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7605171,0.0007404795,0.2299613,0.0003480451,0.00002213062,0.0001200346,0.0004088951,0.0003802543,0.007501754],"genre_scores_gemma":[0.8413332,0.0003469111,0.1554405,0.0001046682,0.00001014701,0.0001089089,0.0006641742,0.00006512275,0.001926473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002158196,"threshold_uncertainty_score":0.004291296,"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."}}