{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002099886,0.0002425286,0.0001905579,0.0003768004,0.0004365664,0.000313131,0.0003326769,0.0002629203,0.0008417299],"category_scores_gemma":[0.001110932,0.0001489051,0.0002966803,0.0003773056,0.0006332938,0.0005561135,0.0005928823,0.0004561076,0.0001134588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003185157,"about_ca_system_score_gemma":0.0007421019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009834184,"about_ca_topic_score_gemma":0.001400395,"domain_scores_codex":[0.9997784,0.00003943758,0.00001580991,0.00005203329,0.00007658368,0.00003755545],"domain_scores_gemma":[0.9990225,0.00039222,0.0001351926,0.0002728024,0.0001179381,0.00005938824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005302128,0.0002278178,0.007466931,0.0006894536,0.0000813989,0.00111919,0.0007453192,0.1475853,0.4274366,0.3389623,0.002134615,0.07302088],"study_design_scores_gemma":[0.0001953542,0.0004753028,0.004849753,0.00007412383,0.0001139842,0.001236759,0.0001502601,0.6042513,0.291023,0.08723622,0.01030119,0.00009269696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8074916,0.000195089,0.1824671,0.0002327831,0.00003262865,0.0001256894,0.0002129064,0.0003772908,0.008864931],"genre_scores_gemma":[0.9520144,0.0001356412,0.04619145,0.00005720936,0.00001034734,0.00004931172,0.0002035173,0.00002545792,0.001312681],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0009834184,"threshold_uncertainty_score":0.002815902,"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."}}