{"id":"W2119604283","doi":"10.1109/tit.2013.2251395","title":"On the Girth of Quasi-Cyclic Protograph LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Girth (graph theory); Low-density parity-check code; Mathematics; Tanner graph; Combinatorics; Upper and lower bounds; Discrete mathematics; Odd graph; Base (topology); Degree (music); Graph; Decoding methods; Chordal graph; Algorithm; 1-planar graph; Error floor","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.0004994496,0.0004052339,0.0003518213,0.0009688063,0.0004500135,0.0005531779,0.0004893811,0.0004532166,0.001347093],"category_scores_gemma":[0.004801919,0.0002733904,0.0003161007,0.0006710469,0.001353914,0.001043196,0.001049332,0.001045007,0.0002433461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007543963,"about_ca_system_score_gemma":0.0005587797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006586419,"about_ca_topic_score_gemma":0.0007598512,"domain_scores_codex":[0.9995684,0.000100549,0.00001528858,0.00007287752,0.0001502646,0.00009270768],"domain_scores_gemma":[0.9964899,0.002378416,0.0003319254,0.0004340331,0.0002060304,0.0001596796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004827176,0.00008001968,0.006949745,0.0003825507,0.00007703281,0.0005590999,0.0008413575,0.5650669,0.08080284,0.2921602,0.001442133,0.05115539],"study_design_scores_gemma":[0.0000373374,0.0002844773,0.004677165,0.0001016292,0.0000454986,0.000628033,0.0001760114,0.6525343,0.02899985,0.3086627,0.003781689,0.00007128255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7778673,0.0008434827,0.2078194,0.0004648998,0.00005991741,0.00004691173,0.0002171155,0.0002552131,0.01242577],"genre_scores_gemma":[0.9799063,0.0007675511,0.01782709,0.00006268396,0.00004192315,0.00004150363,0.0001274418,0.00005237082,0.001173125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001347093,"threshold_uncertainty_score":0.005473614,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009495993991673227,"score_gpt":0.2240988473380092,"score_spread":0.2146028533463359,"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."}}