{"id":"W2913738884","doi":"10.1109/istc.2018.8625355","title":"On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Tanner graph; Low-density parity-check code; Adjacency matrix; Mathematics; Combinatorics; Discrete mathematics; Graph; Algorithm; Decoding methods; 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.001102986,0.0006065357,0.0006925166,0.002805999,0.0007547709,0.001224931,0.0008306863,0.0007723578,0.001376053],"category_scores_gemma":[0.01436428,0.0003193667,0.0004437166,0.002118965,0.001581013,0.003129586,0.0009658898,0.0008625569,0.0002110502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001101038,"about_ca_system_score_gemma":0.0008870274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002778719,"about_ca_topic_score_gemma":0.002786552,"domain_scores_codex":[0.9990514,0.000308999,0.00005604426,0.0001935129,0.0003010008,0.00008907491],"domain_scores_gemma":[0.9901844,0.007159623,0.0008362432,0.0007951654,0.0007836854,0.0002409046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000367455,0.0001240404,0.007491983,0.0003300946,0.00007989234,0.0003339398,0.0006196899,0.3652687,0.02030805,0.487134,0.003248764,0.1146934],"study_design_scores_gemma":[0.00001508569,0.00004219351,0.0008336388,0.00004432088,0.00001422661,0.0001351742,0.00003941466,0.7817803,0.00441395,0.2115389,0.001113591,0.00002918272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3402862,0.001122885,0.649187,0.0007142344,0.0000941835,0.0001273425,0.0005187607,0.0005270366,0.007422359],"genre_scores_gemma":[0.8193301,0.001025128,0.176021,0.0001873899,0.0001394812,0.0001743677,0.0005311147,0.0001440295,0.002447351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002805999,"threshold_uncertainty_score":0.007988572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03132140871814146,"score_gpt":0.2989684878826149,"score_spread":0.2676470791644735,"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."}}