{"id":"W2409452000","doi":"10.1109/tcomm.2017.2737018","title":"Continuous Transmission of Spatially Coupled LDPC Code Chains","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Instituto de Investigación Sanitaria Gregorio Marañón; National Science Foundation; Ministerio de Economía y Competitividad; Universidad Carlos III de Madrid","keywords":"Low-density parity-check code; Decoding methods; Transmission (telecommunications); Computer science; Encoding (memory); Code (set theory); Chain (unit); Concatenated error correction code; Algorithm; Theoretical computer science; Parallel computing; Telecommunications; Block code; 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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004243882,0.0001826638,0.0002801525,0.0001924159,0.001393652,0.0001482688,0.005209953,0.0001190734,0.00002153219],"category_scores_gemma":[0.00003133972,0.0001897474,0.0001750376,0.0001865197,0.0003037285,0.0004631558,0.00002912645,0.0004506056,0.00002067126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005872611,"about_ca_system_score_gemma":0.000134835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005333073,"about_ca_topic_score_gemma":0.0008535013,"domain_scores_codex":[0.9986101,0.0001540002,0.0004287868,0.0003030016,0.0002791514,0.0002249449],"domain_scores_gemma":[0.9927225,0.000349701,0.0003657934,0.006204491,0.0002548215,0.0001027117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001025586,0.003502868,0.0002730858,0.00009382208,0.0002535036,0.00001003273,0.00774564,0.003992157,0.1314096,0.03545948,0.0005586955,0.8165985],"study_design_scores_gemma":[0.001164408,0.0005176227,0.001310795,0.0004046822,0.00008601644,0.00003072804,0.00006687016,0.7657663,0.220196,0.002810691,0.007002357,0.0006436186],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002815345,0.00007366578,0.9872364,0.004312067,0.000311455,0.0003623813,0.00002057007,0.0005547055,0.004313426],"genre_scores_gemma":[0.8742169,0.0004065858,0.1246442,0.00007727012,0.000008698368,0.00008103721,0.000001987823,0.00001977719,0.0005435359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8714016,"threshold_uncertainty_score":0.9999064,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04624845525456713,"score_gpt":0.3185063007431408,"score_spread":0.2722578454885737,"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."}}