{"id":"W1512713022","doi":"10.1109/tit.2015.2445753","title":"Streaming Codes for Multicast Over Burst Erasure Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Erasure; Multicast; Network packet; Converse; Binary erasure channel; Erasure code; Channel (broadcasting); Computer network; Channel capacity; Topology (electrical circuits); Algorithm; Decoding methods; Mathematics","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.0006544902,0.0001249532,0.0001151189,0.0001827369,0.0003242581,0.0002247703,0.0004403962,0.00005945909,0.00002927073],"category_scores_gemma":[0.00003307375,0.0001171582,0.00007069626,0.0002724662,0.0000422503,0.001910051,0.000004925815,0.0001473553,0.00009567906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008314232,"about_ca_system_score_gemma":0.00007045144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002011453,"about_ca_topic_score_gemma":0.000005454786,"domain_scores_codex":[0.9991497,0.0001048667,0.0002733627,0.0001103363,0.0001874743,0.0001742894],"domain_scores_gemma":[0.9987761,0.0002901568,0.00009134577,0.0004381371,0.0002943907,0.0001098457],"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.0001371614,0.0001557564,0.000003813198,0.0000280954,0.00007151469,3.292701e-7,0.01429174,0.08187664,0.0001637439,0.2120524,0.001759566,0.6894593],"study_design_scores_gemma":[0.002508984,0.0002910146,0.00005940741,0.00009678496,0.00002455028,0.00001195245,0.001343289,0.9310801,0.01073109,0.006701514,0.0466485,0.0005027881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001413314,0.00003409063,0.9951209,0.0003703441,0.0007729702,0.0003102714,0.00002144185,0.0002026938,0.001753913],"genre_scores_gemma":[0.9901932,0.00004258565,0.008524841,0.0007455631,0.00003661394,0.000120448,0.000009833123,0.000006702865,0.0003201811],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9887799,"threshold_uncertainty_score":0.4777572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04214069293955126,"score_gpt":0.2856361772895382,"score_spread":0.2434954843499869,"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."}}