{"id":"W3144476509","doi":"","title":"Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth","year":2011,"lang":"en","type":"article","venue":"中国科学:信息科学(英文版)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Circulant matrix; Mathematics; Block code; Permutation matrix; Permutation (music); Random permutation; Block (permutation group theory); Turbo code; Algorithm; Discrete mathematics; Error detection and correction; Combinatorics; Decoding methods","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000758105,0.0005068488,0.0006260625,0.0001915042,0.0005742567,0.0002316335,0.00158303,0.000318425,0.0000282609],"category_scores_gemma":[0.0003514646,0.0005176773,0.0002533094,0.0005535879,0.0005842759,0.0007712379,0.0005447633,0.0005261337,0.00006304251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001789147,"about_ca_system_score_gemma":0.0001436889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009500113,"about_ca_topic_score_gemma":0.000352124,"domain_scores_codex":[0.9965382,0.0002531894,0.0006513813,0.001165675,0.0005321256,0.0008593994],"domain_scores_gemma":[0.9972168,0.0002179051,0.0005500395,0.001174701,0.0005557272,0.0002847842],"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.001299263,0.009234253,0.1775153,0.002761313,0.0007101927,0.0002987947,0.03300401,0.000005079397,0.03833205,0.3820385,0.1603954,0.194406],"study_design_scores_gemma":[0.002651265,0.001981735,0.01978146,0.0006282302,0.0001458698,0.0005625597,0.0007550768,0.01697597,0.837161,0.1131404,0.003475067,0.002741394],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5110186,0.0001610646,0.4803692,0.0006382435,0.001413616,0.001585653,0.00005731381,0.002884657,0.001871611],"genre_scores_gemma":[0.8038541,0.00001491441,0.1953237,0.0003271156,0.0001384627,0.000160824,0.00002627092,0.00004471732,0.0001099191],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.798829,"threshold_uncertainty_score":0.9997275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04253862161378742,"score_gpt":0.2716994727017515,"score_spread":0.2291608510879641,"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."}}