{"id":"W1991921359","doi":"10.1109/lcomm.2012.020212.112311","title":"Counting Short Cycles of Quasi Cyclic Protograph LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Circulant matrix; Mathematics; Eigenvalues and eigenvectors; Parity-check matrix; Enhanced Data Rates for GSM Evolution; Block code; Algorithm; Combinatorics; Discrete mathematics; Computer science; Decoding methods; Error floor; Telecommunications","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.0009067752,0.0001581148,0.000214571,0.0002637721,0.0002671542,0.00006856285,0.003484864,0.00006111406,0.000001805997],"category_scores_gemma":[0.00008134195,0.0001660927,0.0001115209,0.0006665929,0.0002695142,0.0007215339,0.0005495021,0.0002997189,0.00001307257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005221288,"about_ca_system_score_gemma":0.00002450941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001830552,"about_ca_topic_score_gemma":0.00003960483,"domain_scores_codex":[0.9985118,0.0002613787,0.0004085259,0.0001992935,0.0002646826,0.0003543476],"domain_scores_gemma":[0.9958882,0.0004209734,0.0001969834,0.003312261,0.000108577,0.00007302422],"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.000006415003,0.001025963,0.3717375,0.0001009379,0.000127744,0.00000135992,0.008341098,0.00004972419,0.5412555,0.02251137,0.01003846,0.04480384],"study_design_scores_gemma":[0.0008500144,0.0003316162,0.1839468,0.001250849,0.0002055831,0.0002156317,0.001103423,0.03950905,0.7061702,0.003248504,0.05987243,0.003295886],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4668979,0.0005159723,0.5209953,0.006718841,0.0003762925,0.0008629813,0.000004407709,0.00114732,0.00248099],"genre_scores_gemma":[0.8110417,0.00004419968,0.1879976,0.0006466265,0.00004412367,0.0002011384,0.000003546426,0.00001585972,0.000005315528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3441437,"threshold_uncertainty_score":0.6773062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05082889828456905,"score_gpt":0.3211250767263191,"score_spread":0.27029617844175,"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."}}