{"id":"W3000741554","doi":"10.3934/amc.2020062","title":"QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Girth (graph theory); Exponent; Multiplicative function; Tanner graph; Algebraic number; Parity-check matrix; Discrete mathematics; Combinatorics; Decoding methods; Finite field; Code (set theory); Error floor; Set (abstract data type); Statistics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003179246,0.0001117273,0.0002970591,0.0001071956,0.00004295594,0.00000602095,0.002312958,0.00004558596,0.000005666616],"category_scores_gemma":[0.001477508,0.0001184229,0.00007326379,0.0004889289,0.0001766132,0.0002045768,0.000446749,0.0002077001,5.27056e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002049682,"about_ca_system_score_gemma":0.00004188423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002557385,"about_ca_topic_score_gemma":0.00008857127,"domain_scores_codex":[0.9987754,0.0001161689,0.0006622071,0.0001605669,0.0001821188,0.0001035548],"domain_scores_gemma":[0.9920767,0.005135367,0.0006730772,0.001930892,0.0001544979,0.0000294647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001938187,0.004968377,0.02056587,0.004533509,0.0002053414,0.000003123024,0.07314893,0.02406636,0.04705163,0.6603606,0.0002871228,0.1646153],"study_design_scores_gemma":[0.0006845496,0.0005099226,0.0003733898,0.00102631,0.00002233378,0.000001480175,0.001402622,0.7537088,0.1159251,0.1259561,0.0001632553,0.0002261723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01301592,0.0003032377,0.9789128,0.002731049,0.00003187556,0.0004713505,0.00002791513,0.000108821,0.004396984],"genre_scores_gemma":[0.4901847,0.0001402081,0.5095533,0.00008706779,0.00000147264,0.00002609645,0.000002282118,0.000004375974,5.666441e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7296424,"threshold_uncertainty_score":0.4829147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0371959230580113,"score_gpt":0.3101597620060507,"score_spread":0.2729638389480394,"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."}}