{"id":"W2000494984","doi":"10.1007/s11432-010-4152-0","title":"Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth","year":2011,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Circulant matrix; Low-density parity-check code; Block code; Permutation (music); Permutation matrix; Mathematics; Random permutation; Block (permutation group theory); Turbo code; Algorithm; Discrete mathematics; Combinatorics; Decoding methods; Computer science","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":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.004030717,0.0002801926,0.0002852637,0.0005781028,0.002411858,0.00115971,0.003372857,0.00009838631,0.00001149604],"category_scores_gemma":[0.001012984,0.0002382299,0.00009698454,0.002954457,0.004555427,0.01302184,0.0005343514,0.0002328651,0.00004071412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001590303,"about_ca_system_score_gemma":0.000590293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003677392,"about_ca_topic_score_gemma":0.00003171873,"domain_scores_codex":[0.9964501,0.00008035757,0.000674453,0.0006708205,0.001333407,0.0007909218],"domain_scores_gemma":[0.9974902,0.0001111245,0.0007423057,0.0005948171,0.0008176453,0.0002438943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000897818,0.0008642618,0.03948272,0.0004572801,0.00002125876,0.000003505585,0.04680336,0.00004546549,0.008839241,0.7331769,0.006332162,0.1638841],"study_design_scores_gemma":[0.0008137646,0.001387172,0.04590771,0.0002457274,0.00001582948,0.0002303491,0.002135269,0.1571319,0.6394249,0.1507503,0.0005188365,0.001438204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4317324,0.00001572123,0.5599338,0.000509133,0.001072892,0.0008341337,0.00001629794,0.0008689689,0.005016715],"genre_scores_gemma":[0.810546,0.000006385958,0.1890485,0.0002950655,0.00002372896,0.00006219279,0.000004546293,0.000003788968,0.000009842859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6305857,"threshold_uncertainty_score":0.9998772,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03779461409687956,"score_gpt":0.2891319759930405,"score_spread":0.251337361896161,"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."}}