{"id":"W2945033151","doi":"10.1109/tit.2019.2917222","title":"Code Design Based on Connecting Spatially Coupled Graph Chains","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Low-density parity-check code; Decoding methods; Code (set theory); Computer science; Block (permutation group theory); Chain (unit); Concatenated error correction code; Algorithm; Block code; Theoretical computer science; Mathematics; Combinatorics; Physics","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.0001660434,0.0002976484,0.0002605389,0.0004285633,0.0004075945,0.0003685587,0.000560116,0.0005142054,0.0008433488],"category_scores_gemma":[0.0008082368,0.0001946939,0.0001880795,0.0004325096,0.0005526045,0.0004777013,0.0007422259,0.0004954793,0.0003113345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003094093,"about_ca_system_score_gemma":0.0004400755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003555013,"about_ca_topic_score_gemma":0.0007326988,"domain_scores_codex":[0.9997675,0.00006344249,0.00001121051,0.00004737411,0.00008934003,0.0000211168],"domain_scores_gemma":[0.9995598,0.0001256697,0.00006342859,0.0001003451,0.0001091903,0.00004157005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001483912,0.0001119283,0.001184005,0.0002353871,0.00007361837,0.0003616229,0.0002058199,0.4132111,0.3230145,0.1975249,0.001033975,0.06289475],"study_design_scores_gemma":[0.00002425881,0.0001486182,0.0003110824,0.00002076561,0.0000227569,0.0001854671,0.0000227344,0.8989789,0.06498041,0.03131951,0.003956443,0.0000290196],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.245734,0.0002467304,0.7455168,0.0002031302,0.00006980423,0.0001179065,0.00009498907,0.0003286827,0.007687896],"genre_scores_gemma":[0.8272528,0.0002220654,0.1699851,0.00008414796,0.00002274123,0.0001612832,0.00009818323,0.00005295865,0.002120686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008433488,"threshold_uncertainty_score":0.002821267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01446241130644318,"score_gpt":0.2347008881455863,"score_spread":0.2202384768391431,"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."}}