{"id":"W2052423140","doi":"10.1109/tit.2013.2253512","title":"Hierarchical and High-Girth QC LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Circulant matrix; Block code; Code (set theory); Parity-check matrix; Hierarchy; Linear code; Concatenated error correction code; Turbo code","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.0003808411,0.0001364737,0.0001194929,0.0002878151,0.0002417039,0.0002474902,0.0003568389,0.00008711596,0.0001047396],"category_scores_gemma":[0.00001626221,0.0001232751,0.00004625028,0.0002462847,0.00008902414,0.002726631,0.000005237892,0.000294794,0.0003606144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004104523,"about_ca_system_score_gemma":0.0000333855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005623856,"about_ca_topic_score_gemma":0.000005473147,"domain_scores_codex":[0.9990586,0.0001107537,0.0002832893,0.0001415049,0.0002140157,0.0001918061],"domain_scores_gemma":[0.9990398,0.0002933129,0.00008450479,0.0003858563,0.0001019034,0.00009457613],"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.00002356528,0.00006333116,0.000009808363,0.00002996395,0.00002480495,5.91194e-7,0.003433154,0.0008955634,0.0003682807,0.1833332,0.0008886547,0.810929],"study_design_scores_gemma":[0.001910249,0.001115965,0.003863409,0.0002048162,0.00004238883,0.0002320829,0.00107665,0.2651348,0.1603178,0.5578331,0.006616476,0.001652215],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01880515,0.000005550391,0.9764484,0.0005563878,0.0004102769,0.0002648366,0.000006357403,0.0007961221,0.002706949],"genre_scores_gemma":[0.9643195,0.00001893216,0.03440569,0.0009369327,0.00001322011,0.0001053611,0.000001825203,0.00000634792,0.0001921906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9455143,"threshold_uncertainty_score":0.5027013,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006841640311332939,"score_gpt":0.2176891680001549,"score_spread":0.210847527688822,"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."}}