{"id":"W2540504585","doi":"10.1109/acssc.2011.6189949","title":"Correcting erasure bursts with minimum decoding delay","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Erasure code; Decoding methods; Tornado code; Online codes; Interleaving; Fountain code; Block code; Algorithm; Network packet; Coding (social sciences); Concatenated error correction code; Computer network; Mathematics; Statistics","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":[],"consensus_categories":[],"category_scores_codex":[0.0002442203,0.00010217,0.00009790661,0.00005898458,0.0002362199,0.00008982984,0.0007459679,0.00002782554,0.0001368262],"category_scores_gemma":[0.00002547632,0.00007743505,0.00002470909,0.0003764426,0.00002611577,0.0003648429,0.0002497621,0.0001318487,0.00005177106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002244625,"about_ca_system_score_gemma":0.00003908778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001056967,"about_ca_topic_score_gemma":0.0001569158,"domain_scores_codex":[0.9992532,0.00006791105,0.0001357153,0.0002266571,0.0001169162,0.0001995908],"domain_scores_gemma":[0.9991127,0.00008633849,0.00005453858,0.0005463968,0.0001251418,0.00007490856],"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.00002186853,0.0001204555,0.02187223,0.000006452221,0.00005213232,0.00003461969,0.01231356,0.00004818504,0.0007672776,0.1066667,0.002657242,0.8554392],"study_design_scores_gemma":[0.003730761,0.001382612,0.04126129,0.0006370494,0.00005798019,0.001569012,0.002628834,0.8579864,0.06193677,0.002108763,0.02336592,0.003334607],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06588672,0.0001769995,0.8468884,0.0002291683,0.0002020599,0.00009344998,6.906014e-8,0.0002736796,0.08624949],"genre_scores_gemma":[0.8918955,0.00003122736,0.1068599,0.0004044511,0.00002217032,0.000007610479,3.681889e-7,0.000006370635,0.000772425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8579382,"threshold_uncertainty_score":0.315771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06722699874559915,"score_gpt":0.2577962096297761,"score_spread":0.190569210884177,"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."}}