{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002827001,0.0003485346,0.0003265874,0.001680577,0.0004326618,0.000584636,0.0005445646,0.0003499227,0.001070614],"category_scores_gemma":[0.003165913,0.0002382049,0.0001847927,0.001128784,0.0004663355,0.0008060322,0.000460956,0.0003738452,0.0002406986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006616552,"about_ca_system_score_gemma":0.0007973504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002042799,"about_ca_topic_score_gemma":0.003970324,"domain_scores_codex":[0.9994755,0.000125105,0.00003166914,0.0000845276,0.0002385647,0.00004462668],"domain_scores_gemma":[0.9979267,0.0008597731,0.0002997287,0.0003350019,0.0005144889,0.0000642415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004444529,0.00008055758,0.007277913,0.0003666078,0.00007588831,0.0004402323,0.0004377697,0.3390528,0.09997044,0.08477002,0.003912298,0.4631711],"study_design_scores_gemma":[0.00001246798,0.00005185215,0.00133248,0.00001862639,0.00001150727,0.0002336022,0.00003703297,0.9395887,0.02807209,0.02836074,0.002255193,0.00002562868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1417631,0.0001812805,0.8549114,0.00009289555,0.00003173763,0.0000739187,0.0002988944,0.0009338717,0.00171285],"genre_scores_gemma":[0.5720919,0.000266542,0.4239362,0.00005802254,0.00002352982,0.000134882,0.0005737848,0.0001628074,0.002752314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002042799,"threshold_uncertainty_score":0.004800677,"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."}}