{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003493916,0.0001135321,0.0001251918,0.00008402052,0.0003994486,0.0002318245,0.0002433813,0.00003379411,0.00001756287],"category_scores_gemma":[0.00001633209,0.00009368808,0.00003675075,0.0002121953,0.0000540272,0.001347783,0.000003537523,0.0001222816,0.00001336447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001581624,"about_ca_system_score_gemma":0.00003580211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.195696e-7,"about_ca_topic_score_gemma":0.000002007854,"domain_scores_codex":[0.9993642,0.0001041459,0.0001985046,0.0001116033,0.00009676897,0.0001247893],"domain_scores_gemma":[0.9991269,0.0003995021,0.00007488267,0.000189721,0.0001279564,0.00008100059],"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.001608077,0.00007520732,0.000004173397,0.00009689602,0.0001638766,8.807708e-7,0.02792424,0.2440073,0.0007842802,0.1028279,0.0004251007,0.622082],"study_design_scores_gemma":[0.004751285,0.000638807,0.00004205404,0.00009005619,0.00003578161,0.0000142518,0.001283013,0.9579283,0.0250042,0.0007479549,0.009043447,0.000420859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003955463,0.00004633351,0.9936249,0.001401516,0.0001063861,0.0003387116,0.00001336626,0.0001505847,0.0003627491],"genre_scores_gemma":[0.9907162,0.0001419142,0.007614941,0.001352616,0.00002144828,0.00009737878,0.000005458387,0.000005408612,0.00004460077],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9867608,"threshold_uncertainty_score":0.3820489,"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."}}