{"id":"W3131701009","doi":"10.1109/tcomm.2021.3060797","title":"Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Tanner graph; Algorithm; Error floor; Invariant (physics); Computer science; Constraint (computer-aided design); Mathematics; Theoretical computer science; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0001732029,0.0002933535,0.0002195905,0.0003420133,0.0003325675,0.0002737621,0.000501558,0.0002872624,0.0006481218],"category_scores_gemma":[0.0005997836,0.000180186,0.0002458819,0.0002997615,0.0005301418,0.0003288525,0.000587781,0.0004813208,0.0001927304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003040229,"about_ca_system_score_gemma":0.0007040945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003891149,"about_ca_topic_score_gemma":0.0008534982,"domain_scores_codex":[0.9998391,0.00002545001,0.000009330385,0.0000271556,0.000081198,0.00001782379],"domain_scores_gemma":[0.9996916,0.00007661706,0.00006138502,0.00007831088,0.00006783417,0.00002432231],"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.0001123682,0.00009391205,0.001308021,0.0004318826,0.00007178594,0.0004396587,0.0002495193,0.1314526,0.6072076,0.1858463,0.0008202892,0.07196616],"study_design_scores_gemma":[0.00005802398,0.0002381828,0.0007875012,0.00003216326,0.00005650784,0.0005754875,0.00004936907,0.6699796,0.2968655,0.02317143,0.008136366,0.00004983297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1374188,0.0001994907,0.8553324,0.0001280943,0.00004461682,0.0001065549,0.00008793532,0.0003248579,0.00635723],"genre_scores_gemma":[0.6693181,0.0002625561,0.3275324,0.00009554113,0.00001797131,0.0001512793,0.0001329157,0.00005638911,0.002432773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0006481218,"threshold_uncertainty_score":0.002205908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0372330144525903,"score_gpt":0.2670990262776684,"score_spread":0.2298660118250781,"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."}}