{"id":"W4300653865","doi":"10.48550/arxiv.1512.01132","title":"Spatially-coupled Split-component Codes with Iterative Algebraic\\n Decoding","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Binary erasure channel; Decoding methods; Block code; Sequential decoding; Binary symmetric channel; Algorithm; List decoding; Concatenated error correction code; Recursion (computer science); Reed–Muller code; Computer science; Low-density parity-check code; Component (thermodynamics); Mathematics; Channel (broadcasting); Channel capacity","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.001991783,0.001672481,0.001675432,0.001004316,0.0008069679,0.0009166065,0.005386397,0.0008297376,0.0001361619],"category_scores_gemma":[0.0002568827,0.001819557,0.0005348673,0.002198065,0.0007494576,0.001623563,0.005498534,0.002331809,0.0002692717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002084789,"about_ca_system_score_gemma":0.001838985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001866513,"about_ca_topic_score_gemma":0.001373882,"domain_scores_codex":[0.9914631,0.0009219198,0.0009415771,0.004364779,0.0006131852,0.001695474],"domain_scores_gemma":[0.9910995,0.0006923291,0.001624171,0.003677409,0.001839375,0.001067179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002231718,0.001984286,0.0369496,0.0008133697,0.002154922,0.008047516,0.02151753,0.577975,0.00193369,0.3378099,0.001183129,0.007399362],"study_design_scores_gemma":[0.001609686,0.000873773,0.001154824,0.001265583,0.0004073342,0.00009511318,0.0004031328,0.9620554,0.002226002,0.02718935,0.0003783747,0.00234136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4438505,0.00008784507,0.5499042,0.0001284737,0.001008299,0.001051188,0.00001973474,0.0009726376,0.00297709],"genre_scores_gemma":[0.9613512,0.0002094453,0.03609083,0.0001848317,0.0002625739,0.000009403769,0.00004572157,0.0001240224,0.001722037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5175006,"threshold_uncertainty_score":0.9999949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08084402831915222,"score_gpt":0.2117148636670308,"score_spread":0.1308708353478786,"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."}}