{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002790409,0.0003088903,0.0002488894,0.0002788444,0.0003380016,0.0003643095,0.0005636248,0.000347981,0.00105699],"category_scores_gemma":[0.0008578922,0.0001647736,0.0001564741,0.0003564559,0.0005560896,0.0004862723,0.0005652805,0.0004289226,0.0002919688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003220335,"about_ca_system_score_gemma":0.0003377735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005429529,"about_ca_topic_score_gemma":0.000757268,"domain_scores_codex":[0.9997392,0.00007236821,0.00001367031,0.00004577003,0.00009450132,0.00003440085],"domain_scores_gemma":[0.9990951,0.0002528471,0.0001547799,0.0002467255,0.0001861837,0.00006441703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000482036,0.0001481623,0.002041504,0.0002350751,0.00006103895,0.0006643519,0.0004181745,0.2499043,0.5824357,0.06606042,0.001163263,0.09638592],"study_design_scores_gemma":[0.00003466279,0.0002301283,0.0003265665,0.00001693444,0.00002364223,0.0001999914,0.00002833153,0.8608621,0.1283165,0.006801681,0.003121742,0.00003766908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3933282,0.0003798137,0.5981436,0.0001889695,0.00007091514,0.00008225171,0.00008572979,0.0005975848,0.007122975],"genre_scores_gemma":[0.9102557,0.0001290056,0.08773956,0.00005431291,0.00001948792,0.00004915849,0.00004709265,0.0000295141,0.001676196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00105699,"threshold_uncertainty_score":0.003535986,"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."}}