{"id":"W3013193461","doi":"10.1109/tit.2020.2983152","title":"Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Erasure; Convolutional code; Erasure code; Binary erasure channel; Algorithm; Computer science; Network packet; Channel (broadcasting); Code (set theory); Mathematics; Discrete mathematics; Channel capacity; Telecommunications; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001148792,0.0006325877,0.0006420907,0.0005204146,0.0005032706,0.0005676218,0.0008681166,0.0006445325,0.0009062315],"category_scores_gemma":[0.004641925,0.000355989,0.0004532049,0.0005707798,0.0009617585,0.001661624,0.001025164,0.0009224052,0.0002345203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001157223,"about_ca_system_score_gemma":0.001817987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00195025,"about_ca_topic_score_gemma":0.002216832,"domain_scores_codex":[0.9993042,0.0001794936,0.00004171674,0.00009289804,0.0002352313,0.0001464763],"domain_scores_gemma":[0.9970095,0.001678854,0.0003425637,0.0004410828,0.0004058694,0.0001221363],"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.0006075866,0.0001440235,0.001588366,0.0002949313,0.00008034443,0.0002159736,0.0002505065,0.6738257,0.03510972,0.2009393,0.002686386,0.08425715],"study_design_scores_gemma":[0.00005103658,0.0001591628,0.0002092815,0.00003536505,0.00001911105,0.0001233155,0.00003205452,0.9372403,0.0142234,0.04565522,0.002221421,0.00003047164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1690558,0.001036334,0.8243161,0.0005023572,0.0000854996,0.000112977,0.0002165467,0.0005960208,0.004078291],"genre_scores_gemma":[0.7666638,0.0008619564,0.2289079,0.0001923312,0.00008985466,0.0001465209,0.0002905005,0.0001122902,0.002734839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00195025,"threshold_uncertainty_score":0.008396268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02199479959902437,"score_gpt":0.2422311376856142,"score_spread":0.2202363380865899,"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."}}